/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCInlineTransformed.xml -s ../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_NONE.epf -i ../../../trunk/examples/svcomp/systemc/token_ring.01.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-11 00:16:43,126 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-11 00:16:43,127 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-11 00:16:43,163 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-11 00:16:43,163 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-11 00:16:43,165 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-11 00:16:43,168 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-11 00:16:43,169 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-11 00:16:43,171 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-11 00:16:43,171 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-11 00:16:43,172 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-11 00:16:43,173 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-11 00:16:43,174 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-11 00:16:43,174 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-11 00:16:43,175 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-11 00:16:43,176 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-11 00:16:43,177 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-11 00:16:43,178 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-11 00:16:43,179 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-11 00:16:43,180 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-11 00:16:43,181 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-11 00:16:43,182 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-11 00:16:43,183 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-11 00:16:43,184 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-11 00:16:43,186 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-11 00:16:43,186 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-11 00:16:43,187 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-11 00:16:43,187 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-11 00:16:43,188 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-11 00:16:43,188 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-11 00:16:43,189 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-11 00:16:43,189 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-11 00:16:43,190 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-11 00:16:43,191 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-11 00:16:43,191 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-11 00:16:43,192 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-11 00:16:43,192 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-11 00:16:43,192 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-11 00:16:43,193 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-11 00:16:43,193 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-11 00:16:43,194 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-11 00:16:43,195 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_NONE.epf [2022-01-11 00:16:43,214 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-11 00:16:43,214 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-11 00:16:43,214 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-11 00:16:43,215 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-11 00:16:43,216 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-11 00:16:43,216 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-11 00:16:43,216 INFO L138 SettingsManager]: * Use SBE=true [2022-01-11 00:16:43,216 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-11 00:16:43,216 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-11 00:16:43,216 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-11 00:16:43,217 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-11 00:16:43,217 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-11 00:16:43,217 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-11 00:16:43,217 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-11 00:16:43,217 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-11 00:16:43,217 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-11 00:16:43,218 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-11 00:16:43,218 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-11 00:16:43,218 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-11 00:16:43,218 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-11 00:16:43,218 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-11 00:16:43,218 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-11 00:16:43,219 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-11 00:16:43,219 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-11 00:16:43,219 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-11 00:16:43,219 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-11 00:16:43,219 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-11 00:16:43,219 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-11 00:16:43,220 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-11 00:16:43,220 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-11 00:16:43,220 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-11 00:16:43,220 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-11 00:16:43,221 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-11 00:16:43,221 INFO L138 SettingsManager]: * TransformationType=BV_TO_INT_NONE 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/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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-11 00:16:43,469 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-11 00:16:43,488 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-11 00:16:43,490 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-11 00:16:43,491 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-11 00:16:43,495 INFO L275 PluginConnector]: CDTParser initialized [2022-01-11 00:16:43,496 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/token_ring.01.cil-1.c [2022-01-11 00:16:43,551 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/46c6728cd/80240fdf28bf4dec935cf7f314d3806f/FLAG27fe2133e [2022-01-11 00:16:43,888 INFO L306 CDTParser]: Found 1 translation units. [2022-01-11 00:16:43,889 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/token_ring.01.cil-1.c [2022-01-11 00:16:43,895 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/46c6728cd/80240fdf28bf4dec935cf7f314d3806f/FLAG27fe2133e [2022-01-11 00:16:43,904 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/46c6728cd/80240fdf28bf4dec935cf7f314d3806f [2022-01-11 00:16:43,907 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-11 00:16:43,908 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-11 00:16:43,909 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-11 00:16:43,909 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-11 00:16:43,912 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-11 00:16:43,912 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 12:16:43" (1/1) ... [2022-01-11 00:16:43,913 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2db02816 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:16:43, skipping insertion in model container [2022-01-11 00:16:43,913 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 12:16:43" (1/1) ... [2022-01-11 00:16:43,919 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-11 00:16:43,941 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-11 00:16:44,049 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/systemc/token_ring.01.cil-1.c[671,684] [2022-01-11 00:16:44,114 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-11 00:16:44,123 INFO L203 MainTranslator]: Completed pre-run [2022-01-11 00:16:44,133 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/systemc/token_ring.01.cil-1.c[671,684] [2022-01-11 00:16:44,150 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-11 00:16:44,165 INFO L208 MainTranslator]: Completed translation [2022-01-11 00:16:44,166 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:16:44 WrapperNode [2022-01-11 00:16:44,166 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-11 00:16:44,167 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-11 00:16:44,168 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-11 00:16:44,168 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-11 00:16:44,173 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:16:44" (1/1) ... [2022-01-11 00:16:44,190 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:16:44" (1/1) ... [2022-01-11 00:16:44,231 INFO L137 Inliner]: procedures = 30, calls = 34, calls flagged for inlining = 29, calls inlined = 38, statements flattened = 405 [2022-01-11 00:16:44,232 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-11 00:16:44,232 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-11 00:16:44,232 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-11 00:16:44,233 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-11 00:16:44,239 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:16:44" (1/1) ... [2022-01-11 00:16:44,239 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:16:44" (1/1) ... [2022-01-11 00:16:44,253 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:16:44" (1/1) ... [2022-01-11 00:16:44,254 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:16:44" (1/1) ... [2022-01-11 00:16:44,259 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:16:44" (1/1) ... [2022-01-11 00:16:44,278 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:16:44" (1/1) ... [2022-01-11 00:16:44,279 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:16:44" (1/1) ... [2022-01-11 00:16:44,282 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-11 00:16:44,283 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-11 00:16:44,283 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-11 00:16:44,283 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-11 00:16:44,300 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:16:44" (1/1) ... [2022-01-11 00:16:44,306 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-11 00:16:44,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 00:16:44,333 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-11 00:16:44,359 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-11 00:16:44,382 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-11 00:16:44,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-11 00:16:44,383 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-11 00:16:44,383 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-11 00:16:44,450 INFO L234 CfgBuilder]: Building ICFG [2022-01-11 00:16:44,451 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-11 00:16:44,816 INFO L275 CfgBuilder]: Performing block encoding [2022-01-11 00:16:44,822 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-11 00:16:44,822 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-01-11 00:16:44,824 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 12:16:44 BoogieIcfgContainer [2022-01-11 00:16:44,824 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-11 00:16:44,825 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-11 00:16:44,825 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-11 00:16:44,827 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-11 00:16:44,830 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 12:16:44" (1/1) ... [2022-01-11 00:16:44,990 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 11.01 12:16:44 BasicIcfg [2022-01-11 00:16:44,990 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-11 00:16:44,992 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-11 00:16:44,992 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-11 00:16:44,994 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-11 00:16:44,995 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.01 12:16:43" (1/4) ... [2022-01-11 00:16:45,004 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36f826bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 12:16:45, skipping insertion in model container [2022-01-11 00:16:45,005 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:16:44" (2/4) ... [2022-01-11 00:16:45,005 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36f826bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 12:16:45, skipping insertion in model container [2022-01-11 00:16:45,005 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 12:16:44" (3/4) ... [2022-01-11 00:16:45,005 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36f826bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.01 12:16:45, skipping insertion in model container [2022-01-11 00:16:45,006 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 11.01 12:16:44" (4/4) ... [2022-01-11 00:16:45,007 INFO L111 eAbstractionObserver]: Analyzing ICFG token_ring.01.cil-1.cTransformedIcfg [2022-01-11 00:16:45,013 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-11 00:16:45,013 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-11 00:16:45,051 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-11 00:16:45,058 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-11 00:16:45,058 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-11 00:16:45,076 INFO L276 IsEmpty]: Start isEmpty. Operand has 153 states, 151 states have (on average 1.5298013245033113) internal successors, (231), 152 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:16:45,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-01-11 00:16:45,082 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:16:45,082 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 00:16:45,083 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:16:45,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:16:45,086 INFO L85 PathProgramCache]: Analyzing trace with hash 86368549, now seen corresponding path program 1 times [2022-01-11 00:16:45,093 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:16:45,094 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120794570] [2022-01-11 00:16:45,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:16:45,095 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:16:45,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:16:45,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 00:16:45,274 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:16:45,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120794570] [2022-01-11 00:16:45,274 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120794570] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:16:45,275 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:16:45,275 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 00:16:45,276 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937406342] [2022-01-11 00:16:45,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:16:45,280 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:16:45,280 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:16:45,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:16:45,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:16:45,304 INFO L87 Difference]: Start difference. First operand has 153 states, 151 states have (on average 1.5298013245033113) internal successors, (231), 152 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 2 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:16:45,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:16:45,413 INFO L93 Difference]: Finished difference Result 402 states and 610 transitions. [2022-01-11 00:16:45,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:16:45,417 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 2 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2022-01-11 00:16:45,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:16:45,428 INFO L225 Difference]: With dead ends: 402 [2022-01-11 00:16:45,428 INFO L226 Difference]: Without dead ends: 249 [2022-01-11 00:16:45,431 INFO L932 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 [2022-01-11 00:16:45,436 INFO L933 BasicCegarLoop]: 215 mSDtfsCounter, 186 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 00:16:45,436 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [186 Valid, 382 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 00:16:45,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2022-01-11 00:16:45,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 247. [2022-01-11 00:16:45,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 246 states have (on average 1.4593495934959348) internal successors, (359), 246 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:16:45,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 359 transitions. [2022-01-11 00:16:45,503 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 359 transitions. Word has length 43 [2022-01-11 00:16:45,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:16:45,503 INFO L470 AbstractCegarLoop]: Abstraction has 247 states and 359 transitions. [2022-01-11 00:16:45,503 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 2 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:16:45,503 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 359 transitions. [2022-01-11 00:16:45,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-01-11 00:16:45,504 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:16:45,505 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 00:16:45,505 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-11 00:16:45,505 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:16:45,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:16:45,506 INFO L85 PathProgramCache]: Analyzing trace with hash 1192196933, now seen corresponding path program 1 times [2022-01-11 00:16:45,506 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:16:45,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564700459] [2022-01-11 00:16:45,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:16:45,506 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:16:45,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:16:45,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 00:16:45,559 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:16:45,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564700459] [2022-01-11 00:16:45,559 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564700459] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:16:45,559 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:16:45,560 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 00:16:45,560 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732915914] [2022-01-11 00:16:45,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:16:45,561 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:16:45,561 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:16:45,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:16:45,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:16:45,562 INFO L87 Difference]: Start difference. First operand 247 states and 359 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 2 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:16:45,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:16:45,596 INFO L93 Difference]: Finished difference Result 485 states and 706 transitions. [2022-01-11 00:16:45,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:16:45,597 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 2 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2022-01-11 00:16:45,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:16:45,598 INFO L225 Difference]: With dead ends: 485 [2022-01-11 00:16:45,598 INFO L226 Difference]: Without dead ends: 247 [2022-01-11 00:16:45,599 INFO L932 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 [2022-01-11 00:16:45,601 INFO L933 BasicCegarLoop]: 205 mSDtfsCounter, 202 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:16:45,601 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [202 Valid, 205 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:16:45,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2022-01-11 00:16:45,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 247. [2022-01-11 00:16:45,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 246 states have (on average 1.4268292682926829) internal successors, (351), 246 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:16:45,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 351 transitions. [2022-01-11 00:16:45,633 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 351 transitions. Word has length 43 [2022-01-11 00:16:45,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:16:45,634 INFO L470 AbstractCegarLoop]: Abstraction has 247 states and 351 transitions. [2022-01-11 00:16:45,634 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 2 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:16:45,634 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 351 transitions. [2022-01-11 00:16:45,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-01-11 00:16:45,635 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:16:45,635 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 00:16:45,635 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-11 00:16:45,636 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:16:45,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:16:45,636 INFO L85 PathProgramCache]: Analyzing trace with hash 1920605477, now seen corresponding path program 1 times [2022-01-11 00:16:45,636 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:16:45,637 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299890882] [2022-01-11 00:16:45,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:16:45,637 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:16:45,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:16:45,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 00:16:45,718 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:16:45,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299890882] [2022-01-11 00:16:45,719 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299890882] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:16:45,719 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:16:45,719 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 00:16:45,719 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524630090] [2022-01-11 00:16:45,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:16:45,720 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:16:45,720 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:16:45,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:16:45,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:16:45,721 INFO L87 Difference]: Start difference. First operand 247 states and 351 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 2 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:16:45,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:16:45,778 INFO L93 Difference]: Finished difference Result 484 states and 689 transitions. [2022-01-11 00:16:45,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:16:45,779 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 2 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2022-01-11 00:16:45,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:16:45,780 INFO L225 Difference]: With dead ends: 484 [2022-01-11 00:16:45,780 INFO L226 Difference]: Without dead ends: 247 [2022-01-11 00:16:45,781 INFO L932 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 [2022-01-11 00:16:45,782 INFO L933 BasicCegarLoop]: 192 mSDtfsCounter, 170 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:16:45,783 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [170 Valid, 210 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:16:45,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2022-01-11 00:16:45,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 247. [2022-01-11 00:16:45,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 246 states have (on average 1.3699186991869918) internal successors, (337), 246 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:16:45,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 337 transitions. [2022-01-11 00:16:45,799 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 337 transitions. Word has length 43 [2022-01-11 00:16:45,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:16:45,799 INFO L470 AbstractCegarLoop]: Abstraction has 247 states and 337 transitions. [2022-01-11 00:16:45,799 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 2 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:16:45,799 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 337 transitions. [2022-01-11 00:16:45,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-01-11 00:16:45,800 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:16:45,800 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 00:16:45,801 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-11 00:16:45,801 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:16:45,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:16:45,802 INFO L85 PathProgramCache]: Analyzing trace with hash 377872068, now seen corresponding path program 1 times [2022-01-11 00:16:45,802 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:16:45,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047801730] [2022-01-11 00:16:45,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:16:45,802 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:16:45,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:16:45,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 00:16:45,844 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:16:45,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047801730] [2022-01-11 00:16:45,844 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047801730] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:16:45,844 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:16:45,844 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 00:16:45,844 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99393647] [2022-01-11 00:16:45,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:16:45,845 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:16:45,845 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:16:45,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:16:45,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:16:45,846 INFO L87 Difference]: Start difference. First operand 247 states and 337 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 2 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:16:45,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:16:45,885 INFO L93 Difference]: Finished difference Result 483 states and 660 transitions. [2022-01-11 00:16:45,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:16:45,886 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 2 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2022-01-11 00:16:45,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:16:45,887 INFO L225 Difference]: With dead ends: 483 [2022-01-11 00:16:45,887 INFO L226 Difference]: Without dead ends: 247 [2022-01-11 00:16:45,889 INFO L932 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 [2022-01-11 00:16:45,891 INFO L933 BasicCegarLoop]: 183 mSDtfsCounter, 161 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:16:45,891 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [161 Valid, 200 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:16:45,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2022-01-11 00:16:45,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 247. [2022-01-11 00:16:45,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 246 states have (on average 1.3130081300813008) internal successors, (323), 246 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:16:45,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 323 transitions. [2022-01-11 00:16:45,921 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 323 transitions. Word has length 43 [2022-01-11 00:16:45,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:16:45,922 INFO L470 AbstractCegarLoop]: Abstraction has 247 states and 323 transitions. [2022-01-11 00:16:45,922 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 2 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:16:45,922 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 323 transitions. [2022-01-11 00:16:45,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-01-11 00:16:45,923 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:16:45,923 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 00:16:45,923 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-11 00:16:45,924 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:16:45,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:16:45,924 INFO L85 PathProgramCache]: Analyzing trace with hash -232594589, now seen corresponding path program 1 times [2022-01-11 00:16:45,924 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:16:45,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374549296] [2022-01-11 00:16:45,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:16:45,925 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:16:45,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:16:46,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 00:16:46,044 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:16:46,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374549296] [2022-01-11 00:16:46,044 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374549296] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:16:46,044 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:16:46,044 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 00:16:46,044 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940459148] [2022-01-11 00:16:46,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:16:46,045 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:16:46,045 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:16:46,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:16:46,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:16:46,046 INFO L87 Difference]: Start difference. First operand 247 states and 323 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 2 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:16:46,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:16:46,125 INFO L93 Difference]: Finished difference Result 681 states and 895 transitions. [2022-01-11 00:16:46,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:16:46,126 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 2 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2022-01-11 00:16:46,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:16:46,128 INFO L225 Difference]: With dead ends: 681 [2022-01-11 00:16:46,129 INFO L226 Difference]: Without dead ends: 447 [2022-01-11 00:16:46,130 INFO L932 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 [2022-01-11 00:16:46,141 INFO L933 BasicCegarLoop]: 184 mSDtfsCounter, 134 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:16:46,142 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [134 Valid, 326 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:16:46,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2022-01-11 00:16:46,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 421. [2022-01-11 00:16:46,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 420 states have (on average 1.2952380952380953) internal successors, (544), 420 states have internal predecessors, (544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:16:46,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 544 transitions. [2022-01-11 00:16:46,177 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 544 transitions. Word has length 43 [2022-01-11 00:16:46,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:16:46,179 INFO L470 AbstractCegarLoop]: Abstraction has 421 states and 544 transitions. [2022-01-11 00:16:46,180 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 2 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:16:46,182 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 544 transitions. [2022-01-11 00:16:46,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-01-11 00:16:46,193 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:16:46,193 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 00:16:46,193 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-11 00:16:46,194 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:16:46,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:16:46,194 INFO L85 PathProgramCache]: Analyzing trace with hash -342188178, now seen corresponding path program 1 times [2022-01-11 00:16:46,194 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:16:46,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456958862] [2022-01-11 00:16:46,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:16:46,195 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:16:46,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:16:46,319 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 00:16:46,319 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:16:46,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456958862] [2022-01-11 00:16:46,319 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456958862] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:16:46,319 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:16:46,319 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 00:16:46,320 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377890147] [2022-01-11 00:16:46,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:16:46,321 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:16:46,321 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:16:46,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:16:46,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:16:46,322 INFO L87 Difference]: Start difference. First operand 421 states and 544 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:16:46,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:16:46,394 INFO L93 Difference]: Finished difference Result 1163 states and 1509 transitions. [2022-01-11 00:16:46,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:16:46,395 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2022-01-11 00:16:46,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:16:46,398 INFO L225 Difference]: With dead ends: 1163 [2022-01-11 00:16:46,398 INFO L226 Difference]: Without dead ends: 761 [2022-01-11 00:16:46,399 INFO L932 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 [2022-01-11 00:16:46,403 INFO L933 BasicCegarLoop]: 181 mSDtfsCounter, 133 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:16:46,406 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [133 Valid, 323 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:16:46,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 761 states. [2022-01-11 00:16:46,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 761 to 727. [2022-01-11 00:16:46,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 727 states, 726 states have (on average 1.2920110192837466) internal successors, (938), 726 states have internal predecessors, (938), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:16:46,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 727 states and 938 transitions. [2022-01-11 00:16:46,444 INFO L78 Accepts]: Start accepts. Automaton has 727 states and 938 transitions. Word has length 69 [2022-01-11 00:16:46,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:16:46,446 INFO L470 AbstractCegarLoop]: Abstraction has 727 states and 938 transitions. [2022-01-11 00:16:46,446 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:16:46,446 INFO L276 IsEmpty]: Start isEmpty. Operand 727 states and 938 transitions. [2022-01-11 00:16:46,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-01-11 00:16:46,447 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:16:46,447 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 00:16:46,447 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-11 00:16:46,448 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:16:46,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:16:46,448 INFO L85 PathProgramCache]: Analyzing trace with hash -948485715, now seen corresponding path program 1 times [2022-01-11 00:16:46,449 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:16:46,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054528144] [2022-01-11 00:16:46,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:16:46,449 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:16:46,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:16:46,539 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 00:16:46,539 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:16:46,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054528144] [2022-01-11 00:16:46,540 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054528144] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:16:46,540 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:16:46,540 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 00:16:46,540 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095858688] [2022-01-11 00:16:46,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:16:46,541 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:16:46,542 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:16:46,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:16:46,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:16:46,543 INFO L87 Difference]: Start difference. First operand 727 states and 938 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:16:46,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:16:46,641 INFO L93 Difference]: Finished difference Result 2064 states and 2655 transitions. [2022-01-11 00:16:46,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:16:46,641 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2022-01-11 00:16:46,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:16:46,647 INFO L225 Difference]: With dead ends: 2064 [2022-01-11 00:16:46,647 INFO L226 Difference]: Without dead ends: 1366 [2022-01-11 00:16:46,649 INFO L932 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 [2022-01-11 00:16:46,650 INFO L933 BasicCegarLoop]: 201 mSDtfsCounter, 148 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:16:46,650 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [148 Valid, 365 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:16:46,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1366 states. [2022-01-11 00:16:46,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1366 to 1348. [2022-01-11 00:16:46,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1348 states, 1347 states have (on average 1.2628062360801782) internal successors, (1701), 1347 states have internal predecessors, (1701), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:16:46,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1348 states to 1348 states and 1701 transitions. [2022-01-11 00:16:46,750 INFO L78 Accepts]: Start accepts. Automaton has 1348 states and 1701 transitions. Word has length 69 [2022-01-11 00:16:46,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:16:46,750 INFO L470 AbstractCegarLoop]: Abstraction has 1348 states and 1701 transitions. [2022-01-11 00:16:46,750 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:16:46,750 INFO L276 IsEmpty]: Start isEmpty. Operand 1348 states and 1701 transitions. [2022-01-11 00:16:46,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-01-11 00:16:46,751 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:16:46,752 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 00:16:46,752 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-11 00:16:46,752 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:16:46,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:16:46,753 INFO L85 PathProgramCache]: Analyzing trace with hash -1769856115, now seen corresponding path program 1 times [2022-01-11 00:16:46,753 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:16:46,754 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607421613] [2022-01-11 00:16:46,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:16:46,754 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:16:46,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:16:46,794 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-11 00:16:46,795 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:16:46,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607421613] [2022-01-11 00:16:46,795 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607421613] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:16:46,795 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:16:46,795 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 00:16:46,795 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242825693] [2022-01-11 00:16:46,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:16:46,796 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:16:46,796 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:16:46,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:16:46,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:16:46,797 INFO L87 Difference]: Start difference. First operand 1348 states and 1701 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:16:46,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:16:46,902 INFO L93 Difference]: Finished difference Result 2650 states and 3350 transitions. [2022-01-11 00:16:46,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:16:46,903 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2022-01-11 00:16:46,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:16:46,907 INFO L225 Difference]: With dead ends: 2650 [2022-01-11 00:16:46,907 INFO L226 Difference]: Without dead ends: 1325 [2022-01-11 00:16:46,909 INFO L932 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 [2022-01-11 00:16:46,910 INFO L933 BasicCegarLoop]: 186 mSDtfsCounter, 182 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:16:46,910 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [182 Valid, 186 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:16:46,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1325 states. [2022-01-11 00:16:46,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1325 to 1325. [2022-01-11 00:16:46,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1325 states, 1324 states have (on average 1.2651057401812689) internal successors, (1675), 1324 states have internal predecessors, (1675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:16:46,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1325 states to 1325 states and 1675 transitions. [2022-01-11 00:16:46,987 INFO L78 Accepts]: Start accepts. Automaton has 1325 states and 1675 transitions. Word has length 69 [2022-01-11 00:16:46,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:16:46,988 INFO L470 AbstractCegarLoop]: Abstraction has 1325 states and 1675 transitions. [2022-01-11 00:16:46,989 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:16:46,989 INFO L276 IsEmpty]: Start isEmpty. Operand 1325 states and 1675 transitions. [2022-01-11 00:16:46,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-01-11 00:16:46,990 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:16:46,990 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 00:16:46,990 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-11 00:16:46,990 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:16:46,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:16:46,992 INFO L85 PathProgramCache]: Analyzing trace with hash -61150792, now seen corresponding path program 1 times [2022-01-11 00:16:46,993 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:16:46,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499408003] [2022-01-11 00:16:46,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:16:46,993 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:16:47,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:16:47,051 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 00:16:47,052 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:16:47,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499408003] [2022-01-11 00:16:47,052 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499408003] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:16:47,052 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:16:47,052 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 00:16:47,052 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628116381] [2022-01-11 00:16:47,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:16:47,053 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:16:47,053 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:16:47,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:16:47,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:16:47,054 INFO L87 Difference]: Start difference. First operand 1325 states and 1675 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:16:47,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:16:47,213 INFO L93 Difference]: Finished difference Result 3727 states and 4702 transitions. [2022-01-11 00:16:47,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:16:47,214 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2022-01-11 00:16:47,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:16:47,222 INFO L225 Difference]: With dead ends: 3727 [2022-01-11 00:16:47,223 INFO L226 Difference]: Without dead ends: 2431 [2022-01-11 00:16:47,224 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:16:47,226 INFO L933 BasicCegarLoop]: 323 mSDtfsCounter, 137 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:16:47,226 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [137 Valid, 491 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:16:47,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2431 states. [2022-01-11 00:16:47,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2431 to 2431. [2022-01-11 00:16:47,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2431 states, 2430 states have (on average 1.2325102880658436) internal successors, (2995), 2430 states have internal predecessors, (2995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:16:47,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2431 states to 2431 states and 2995 transitions. [2022-01-11 00:16:47,342 INFO L78 Accepts]: Start accepts. Automaton has 2431 states and 2995 transitions. Word has length 70 [2022-01-11 00:16:47,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:16:47,343 INFO L470 AbstractCegarLoop]: Abstraction has 2431 states and 2995 transitions. [2022-01-11 00:16:47,343 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:16:47,343 INFO L276 IsEmpty]: Start isEmpty. Operand 2431 states and 2995 transitions. [2022-01-11 00:16:47,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-01-11 00:16:47,352 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:16:47,352 INFO L514 BasicCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1] [2022-01-11 00:16:47,352 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-11 00:16:47,352 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:16:47,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:16:47,353 INFO L85 PathProgramCache]: Analyzing trace with hash -2029911604, now seen corresponding path program 1 times [2022-01-11 00:16:47,353 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:16:47,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80091100] [2022-01-11 00:16:47,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:16:47,354 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:16:47,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:16:47,407 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-01-11 00:16:47,407 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:16:47,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80091100] [2022-01-11 00:16:47,407 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80091100] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:16:47,408 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:16:47,408 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 00:16:47,408 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933269124] [2022-01-11 00:16:47,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:16:47,408 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:16:47,408 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:16:47,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:16:47,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:16:47,409 INFO L87 Difference]: Start difference. First operand 2431 states and 2995 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:16:47,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:16:47,534 INFO L93 Difference]: Finished difference Result 4295 states and 5312 transitions. [2022-01-11 00:16:47,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:16:47,535 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 102 [2022-01-11 00:16:47,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:16:47,543 INFO L225 Difference]: With dead ends: 4295 [2022-01-11 00:16:47,543 INFO L226 Difference]: Without dead ends: 2451 [2022-01-11 00:16:47,545 INFO L932 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 [2022-01-11 00:16:47,546 INFO L933 BasicCegarLoop]: 188 mSDtfsCounter, 130 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:16:47,547 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [130 Valid, 353 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:16:47,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2451 states. [2022-01-11 00:16:47,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2451 to 2383. [2022-01-11 00:16:47,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2383 states, 2382 states have (on average 1.2002518891687657) internal successors, (2859), 2382 states have internal predecessors, (2859), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:16:47,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2383 states to 2383 states and 2859 transitions. [2022-01-11 00:16:47,676 INFO L78 Accepts]: Start accepts. Automaton has 2383 states and 2859 transitions. Word has length 102 [2022-01-11 00:16:47,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:16:47,676 INFO L470 AbstractCegarLoop]: Abstraction has 2383 states and 2859 transitions. [2022-01-11 00:16:47,677 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:16:47,677 INFO L276 IsEmpty]: Start isEmpty. Operand 2383 states and 2859 transitions. [2022-01-11 00:16:47,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-01-11 00:16:47,679 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:16:47,679 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 00:16:47,680 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-11 00:16:47,680 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:16:47,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:16:47,681 INFO L85 PathProgramCache]: Analyzing trace with hash -1094457963, now seen corresponding path program 1 times [2022-01-11 00:16:47,681 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:16:47,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920085673] [2022-01-11 00:16:47,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:16:47,681 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:16:47,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:16:47,725 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-11 00:16:47,726 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:16:47,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920085673] [2022-01-11 00:16:47,726 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920085673] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:16:47,726 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:16:47,726 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 00:16:47,726 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603770572] [2022-01-11 00:16:47,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:16:47,727 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:16:47,727 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:16:47,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:16:47,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:16:47,728 INFO L87 Difference]: Start difference. First operand 2383 states and 2859 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:16:47,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:16:47,839 INFO L93 Difference]: Finished difference Result 4715 states and 5661 transitions. [2022-01-11 00:16:47,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:16:47,840 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 103 [2022-01-11 00:16:47,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:16:47,847 INFO L225 Difference]: With dead ends: 4715 [2022-01-11 00:16:47,848 INFO L226 Difference]: Without dead ends: 2385 [2022-01-11 00:16:47,851 INFO L932 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 [2022-01-11 00:16:47,851 INFO L933 BasicCegarLoop]: 287 mSDtfsCounter, 115 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:16:47,852 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [115 Valid, 456 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:16:47,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2385 states. [2022-01-11 00:16:47,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2385 to 2383. [2022-01-11 00:16:47,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2383 states, 2382 states have (on average 1.1834592779177162) internal successors, (2819), 2382 states have internal predecessors, (2819), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:16:47,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2383 states to 2383 states and 2819 transitions. [2022-01-11 00:16:47,994 INFO L78 Accepts]: Start accepts. Automaton has 2383 states and 2819 transitions. Word has length 103 [2022-01-11 00:16:47,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:16:47,995 INFO L470 AbstractCegarLoop]: Abstraction has 2383 states and 2819 transitions. [2022-01-11 00:16:47,996 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:16:47,996 INFO L276 IsEmpty]: Start isEmpty. Operand 2383 states and 2819 transitions. [2022-01-11 00:16:47,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-01-11 00:16:47,999 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:16:47,999 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 00:16:47,999 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-11 00:16:48,000 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:16:48,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:16:48,000 INFO L85 PathProgramCache]: Analyzing trace with hash -924280847, now seen corresponding path program 1 times [2022-01-11 00:16:48,000 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:16:48,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730227859] [2022-01-11 00:16:48,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:16:48,001 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:16:48,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:16:48,062 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 00:16:48,062 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:16:48,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730227859] [2022-01-11 00:16:48,062 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730227859] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:16:48,063 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:16:48,063 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 00:16:48,063 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477694175] [2022-01-11 00:16:48,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:16:48,064 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:16:48,064 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:16:48,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:16:48,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:16:48,065 INFO L87 Difference]: Start difference. First operand 2383 states and 2819 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:16:48,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:16:48,162 INFO L93 Difference]: Finished difference Result 4205 states and 4989 transitions. [2022-01-11 00:16:48,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:16:48,163 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 103 [2022-01-11 00:16:48,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:16:48,168 INFO L225 Difference]: With dead ends: 4205 [2022-01-11 00:16:48,168 INFO L226 Difference]: Without dead ends: 1875 [2022-01-11 00:16:48,171 INFO L932 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 [2022-01-11 00:16:48,172 INFO L933 BasicCegarLoop]: 288 mSDtfsCounter, 111 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:16:48,172 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [111 Valid, 432 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:16:48,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1875 states. [2022-01-11 00:16:48,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1875 to 1857. [2022-01-11 00:16:48,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1857 states, 1856 states have (on average 1.1632543103448276) internal successors, (2159), 1856 states have internal predecessors, (2159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:16:48,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1857 states to 1857 states and 2159 transitions. [2022-01-11 00:16:48,241 INFO L78 Accepts]: Start accepts. Automaton has 1857 states and 2159 transitions. Word has length 103 [2022-01-11 00:16:48,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:16:48,241 INFO L470 AbstractCegarLoop]: Abstraction has 1857 states and 2159 transitions. [2022-01-11 00:16:48,241 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:16:48,241 INFO L276 IsEmpty]: Start isEmpty. Operand 1857 states and 2159 transitions. [2022-01-11 00:16:48,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-01-11 00:16:48,243 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:16:48,243 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 00:16:48,244 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-11 00:16:48,244 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:16:48,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:16:48,244 INFO L85 PathProgramCache]: Analyzing trace with hash 400890170, now seen corresponding path program 1 times [2022-01-11 00:16:48,244 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:16:48,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293436373] [2022-01-11 00:16:48,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:16:48,245 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:16:48,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:16:48,309 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-01-11 00:16:48,310 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:16:48,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293436373] [2022-01-11 00:16:48,310 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293436373] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:16:48,310 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:16:48,310 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-11 00:16:48,310 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208033519] [2022-01-11 00:16:48,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:16:48,311 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-11 00:16:48,311 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:16:48,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-11 00:16:48,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-11 00:16:48,311 INFO L87 Difference]: Start difference. First operand 1857 states and 2159 transitions. Second operand has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:16:48,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:16:48,487 INFO L93 Difference]: Finished difference Result 3332 states and 3878 transitions. [2022-01-11 00:16:48,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-11 00:16:48,487 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 104 [2022-01-11 00:16:48,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:16:48,492 INFO L225 Difference]: With dead ends: 3332 [2022-01-11 00:16:48,492 INFO L226 Difference]: Without dead ends: 1492 [2022-01-11 00:16:48,494 INFO L932 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 [2022-01-11 00:16:48,495 INFO L933 BasicCegarLoop]: 196 mSDtfsCounter, 451 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 451 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:16:48,495 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [451 Valid, 490 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:16:48,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1492 states. [2022-01-11 00:16:48,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1492 to 1292. [2022-01-11 00:16:48,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1292 states, 1291 states have (on average 1.139426800929512) internal successors, (1471), 1291 states have internal predecessors, (1471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:16:48,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1292 states to 1292 states and 1471 transitions. [2022-01-11 00:16:48,565 INFO L78 Accepts]: Start accepts. Automaton has 1292 states and 1471 transitions. Word has length 104 [2022-01-11 00:16:48,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:16:48,565 INFO L470 AbstractCegarLoop]: Abstraction has 1292 states and 1471 transitions. [2022-01-11 00:16:48,565 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:16:48,565 INFO L276 IsEmpty]: Start isEmpty. Operand 1292 states and 1471 transitions. [2022-01-11 00:16:48,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-01-11 00:16:48,567 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:16:48,567 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 00:16:48,567 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-11 00:16:48,567 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:16:48,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:16:48,568 INFO L85 PathProgramCache]: Analyzing trace with hash 1026333048, now seen corresponding path program 1 times [2022-01-11 00:16:48,568 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:16:48,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758518170] [2022-01-11 00:16:48,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:16:48,568 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:16:48,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:16:48,628 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-01-11 00:16:48,628 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:16:48,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758518170] [2022-01-11 00:16:48,629 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758518170] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:16:48,629 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:16:48,629 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-11 00:16:48,629 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416195059] [2022-01-11 00:16:48,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:16:48,629 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-11 00:16:48,630 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:16:48,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-11 00:16:48,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-11 00:16:48,630 INFO L87 Difference]: Start difference. First operand 1292 states and 1471 transitions. Second operand has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:16:48,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:16:48,763 INFO L93 Difference]: Finished difference Result 2348 states and 2670 transitions. [2022-01-11 00:16:48,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-11 00:16:48,764 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 104 [2022-01-11 00:16:48,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:16:48,766 INFO L225 Difference]: With dead ends: 2348 [2022-01-11 00:16:48,766 INFO L226 Difference]: Without dead ends: 682 [2022-01-11 00:16:48,769 INFO L932 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 [2022-01-11 00:16:48,769 INFO L933 BasicCegarLoop]: 174 mSDtfsCounter, 379 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 379 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 00:16:48,770 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [379 Valid, 440 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 00:16:48,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2022-01-11 00:16:48,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 616. [2022-01-11 00:16:48,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 616 states, 615 states have (on average 1.0975609756097562) internal successors, (675), 615 states have internal predecessors, (675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:16:48,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 616 states and 675 transitions. [2022-01-11 00:16:48,808 INFO L78 Accepts]: Start accepts. Automaton has 616 states and 675 transitions. Word has length 104 [2022-01-11 00:16:48,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:16:48,809 INFO L470 AbstractCegarLoop]: Abstraction has 616 states and 675 transitions. [2022-01-11 00:16:48,809 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:16:48,809 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 675 transitions. [2022-01-11 00:16:48,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-01-11 00:16:48,810 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:16:48,810 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 00:16:48,810 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-11 00:16:48,810 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:16:48,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:16:48,811 INFO L85 PathProgramCache]: Analyzing trace with hash 29260695, now seen corresponding path program 1 times [2022-01-11 00:16:48,811 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:16:48,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768972991] [2022-01-11 00:16:48,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:16:48,811 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:16:48,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:16:48,932 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-01-11 00:16:48,932 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:16:48,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768972991] [2022-01-11 00:16:48,932 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768972991] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:16:48,932 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:16:48,933 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-11 00:16:48,933 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825165906] [2022-01-11 00:16:48,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:16:48,933 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-11 00:16:48,933 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:16:48,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-11 00:16:48,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-11 00:16:48,934 INFO L87 Difference]: Start difference. First operand 616 states and 675 transitions. Second operand has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:16:49,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:16:49,026 INFO L93 Difference]: Finished difference Result 620 states and 679 transitions. [2022-01-11 00:16:49,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-11 00:16:49,027 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 104 [2022-01-11 00:16:49,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:16:49,027 INFO L225 Difference]: With dead ends: 620 [2022-01-11 00:16:49,027 INFO L226 Difference]: Without dead ends: 0 [2022-01-11 00:16:49,030 INFO L932 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 [2022-01-11 00:16:49,030 INFO L933 BasicCegarLoop]: 246 mSDtfsCounter, 199 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:16:49,031 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [199 Valid, 489 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:16:49,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-01-11 00:16:49,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-01-11 00:16:49,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:16:49,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-01-11 00:16:49,032 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 104 [2022-01-11 00:16:49,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:16:49,032 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-01-11 00:16:49,032 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:16:49,032 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-01-11 00:16:49,033 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-01-11 00:16:49,035 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-01-11 00:16:49,035 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-11 00:16:49,037 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-01-11 00:17:00,910 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-01-11 00:17:00,910 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-01-11 00:17:00,911 INFO L854 garLoopResultBuilder]: At program point L391(lines 384 393) the Hoare annotation is: (and (= (+ (* (- 1) ~local~0Int) ~token~0Int) 0) (= 0 ~m_st~0Int) (<= 2 ~E_1~0Int) (<= 2 ~E_M~0Int) (not (= (+ (- 1) ~t1_pc~0Int) 0)) (= (+ (- 2) ~M_E~0Int) 0) (= ~t1_i~0Int 1) (= ~m_pc~0Int 0) (<= 2 ~T1_E~0Int) (= 0 ~t1_st~0Int)) [2022-01-11 00:17:00,911 INFO L854 garLoopResultBuilder]: At program point L163(lines 158 165) the Hoare annotation is: (and (= (+ (* (- 1) ~local~0Int) ~token~0Int) 0) (= 0 ~m_st~0Int) (<= 2 ~E_1~0Int) (<= 2 ~E_M~0Int) (not (= (+ (- 1) ~t1_pc~0Int) 0)) (= (+ (- 2) ~M_E~0Int) 0) (= ~t1_i~0Int 1) (= ~m_pc~0Int 0) (<= 2 ~T1_E~0Int) (= 0 ~t1_st~0Int)) [2022-01-11 00:17:00,911 INFO L858 garLoopResultBuilder]: For program point L170(lines 170 174) no Hoare annotation was computed. [2022-01-11 00:17:00,911 INFO L858 garLoopResultBuilder]: For program point L170-2(lines 169 182) no Hoare annotation was computed. [2022-01-11 00:17:00,911 INFO L854 garLoopResultBuilder]: At program point L175-1(lines 166 183) the Hoare annotation is: (let ((.cse0 (<= 2 ~E_1~0Int)) (.cse1 (<= 2 ~E_M~0Int)) (.cse2 (not (= (+ (- 1) ~t1_pc~0Int) 0))) (.cse3 (= (+ (- 2) ~M_E~0Int) 0)) (.cse4 (= ~t1_i~0Int 1)) (.cse5 (= ~m_pc~0Int 0)) (.cse6 (<= 2 ~T1_E~0Int)) (.cse7 (= 0 ~t1_st~0Int))) (or (and (= (+ (* (- 1) ~local~0Int) ~token~0Int) 0) (= 0 ~m_st~0Int) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and (= (+ (- 2) ~m_st~0Int) 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7))) [2022-01-11 00:17:00,911 INFO L858 garLoopResultBuilder]: For program point L259(lines 259 263) no Hoare annotation was computed. [2022-01-11 00:17:00,911 INFO L858 garLoopResultBuilder]: For program point L259-2(lines 258 281) no Hoare annotation was computed. [2022-01-11 00:17:00,912 INFO L858 garLoopResultBuilder]: For program point L264-1(lines 258 281) no Hoare annotation was computed. [2022-01-11 00:17:00,912 INFO L858 garLoopResultBuilder]: For program point L269-1(lines 258 281) no Hoare annotation was computed. [2022-01-11 00:17:00,912 INFO L854 garLoopResultBuilder]: At program point L274-1(lines 255 282) the Hoare annotation is: (let ((.cse0 (<= 2 ~E_1~0Int)) (.cse1 (<= 2 ~E_M~0Int)) (.cse2 (not (= (+ (- 1) ~t1_pc~0Int) 0))) (.cse3 (= (+ (- 2) ~M_E~0Int) 0)) (.cse4 (= ~t1_i~0Int 1)) (.cse5 (= ~m_pc~0Int 0)) (.cse6 (<= 2 ~T1_E~0Int)) (.cse7 (= 0 ~t1_st~0Int))) (or (and (= (+ (* (- 1) ~local~0Int) ~token~0Int) 0) (= 0 ~m_st~0Int) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and (= (+ (- 2) ~m_st~0Int) 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7))) [2022-01-11 00:17:00,912 INFO L858 garLoopResultBuilder]: For program point L124(lines 124 133) no Hoare annotation was computed. [2022-01-11 00:17:00,912 INFO L858 garLoopResultBuilder]: For program point L125(lines 125 130) no Hoare annotation was computed. [2022-01-11 00:17:00,912 INFO L858 garLoopResultBuilder]: For program point L124-2(lines 124 133) no Hoare annotation was computed. [2022-01-11 00:17:00,912 INFO L854 garLoopResultBuilder]: At program point L135(lines 123 137) the Hoare annotation is: (let ((.cse0 (<= 2 ~E_1~0Int)) (.cse1 (<= 2 ~E_M~0Int)) (.cse2 (not (= (+ (- 1) ~t1_pc~0Int) 0))) (.cse3 (= (+ (- 2) ~M_E~0Int) 0)) (.cse4 (= ~t1_i~0Int 1)) (.cse5 (= ~m_pc~0Int 0)) (.cse6 (<= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_~__retres1~0#1Int| 0)) (.cse7 (<= 2 ~T1_E~0Int)) (.cse8 (= 0 ~t1_st~0Int))) (or (and (= (+ (- 2) ~m_st~0Int) 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and (= (+ (* (- 1) ~local~0Int) ~token~0Int) 0) (= 0 ~m_st~0Int) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8))) [2022-01-11 00:17:00,912 INFO L854 garLoopResultBuilder]: At program point L136(lines 120 138) the Hoare annotation is: (let ((.cse0 (<= 2 ~E_1~0Int)) (.cse1 (<= 2 ~E_M~0Int)) (.cse2 (not (= (+ (- 1) ~t1_pc~0Int) 0))) (.cse3 (<= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_#res#1Int| 0)) (.cse4 (= (+ (- 2) ~M_E~0Int) 0)) (.cse5 (= ~t1_i~0Int 1)) (.cse6 (= ~m_pc~0Int 0)) (.cse7 (<= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_~__retres1~0#1Int| 0)) (.cse8 (<= 2 ~T1_E~0Int)) (.cse9 (= 0 ~t1_st~0Int))) (or (and (= (+ (* (- 1) ~local~0Int) ~token~0Int) 0) (= 0 ~m_st~0Int) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and (= (+ (- 2) ~m_st~0Int) 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) [2022-01-11 00:17:00,912 INFO L858 garLoopResultBuilder]: For program point L319(lines 319 323) no Hoare annotation was computed. [2022-01-11 00:17:00,913 INFO L858 garLoopResultBuilder]: For program point L319-2(lines 319 323) no Hoare annotation was computed. [2022-01-11 00:17:00,913 INFO L858 garLoopResultBuilder]: For program point L143(lines 143 152) no Hoare annotation was computed. [2022-01-11 00:17:00,913 INFO L858 garLoopResultBuilder]: For program point L144(lines 144 149) no Hoare annotation was computed. [2022-01-11 00:17:00,913 INFO L858 garLoopResultBuilder]: For program point L143-2(lines 143 152) no Hoare annotation was computed. [2022-01-11 00:17:00,913 INFO L854 garLoopResultBuilder]: At program point L154(lines 142 156) the Hoare annotation is: (let ((.cse0 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp~1#1Int| 1))) (.cse1 (<= 2 ~E_1~0Int)) (.cse2 (<= 2 ~E_M~0Int)) (.cse3 (not (= (+ (- 1) ~t1_pc~0Int) 0))) (.cse4 (<= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_#res#1Int| 0)) (.cse5 (= (+ (- 2) ~M_E~0Int) 0)) (.cse6 (= ~t1_i~0Int 1)) (.cse7 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp~1#1Int| 0)) (.cse8 (= ~m_pc~0Int 0)) (.cse9 (<= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_~__retres1~0#1Int| 0)) (.cse10 (<= 2 ~T1_E~0Int)) (.cse11 (= 0 ~t1_st~0Int))) (or (and (= (+ (- 2) ~m_st~0Int) 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 (= (+ (* (- 1) ~local~0Int) ~token~0Int) 0) (= 0 ~m_st~0Int) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_~__retres1~1#1Int| 0)))) [2022-01-11 00:17:00,914 INFO L854 garLoopResultBuilder]: At program point L155(lines 139 157) the Hoare annotation is: (let ((.cse0 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp~1#1Int| 1))) (.cse1 (<= 2 ~E_1~0Int)) (.cse2 (<= 2 ~E_M~0Int)) (.cse3 (not (= (+ (- 1) ~t1_pc~0Int) 0))) (.cse4 (<= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_#res#1Int| 0)) (.cse5 (= (+ (- 2) ~M_E~0Int) 0)) (.cse6 (= ~t1_i~0Int 1)) (.cse7 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp~1#1Int| 0)) (.cse8 (= ~m_pc~0Int 0)) (.cse9 (<= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_~__retres1~0#1Int| 0)) (.cse10 (<= 2 ~T1_E~0Int)) (.cse11 (= 0 ~t1_st~0Int))) (or (and (= (+ (- 2) ~m_st~0Int) 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 (= (+ (* (- 1) ~local~0Int) ~token~0Int) 0) (= 0 ~m_st~0Int) .cse1 .cse2 .cse3 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_#res#1Int| 0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_~__retres1~1#1Int| 0)))) [2022-01-11 00:17:00,914 INFO L858 garLoopResultBuilder]: For program point L327(lines 327 331) no Hoare annotation was computed. [2022-01-11 00:17:00,914 INFO L854 garLoopResultBuilder]: At program point L327-2(lines 311 335) the Hoare annotation is: (let ((.cse0 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp~1#1Int| 1))) (.cse1 (<= 2 ~E_1~0Int)) (.cse2 (<= 2 ~E_M~0Int)) (.cse3 (not (= (+ (- 1) ~t1_pc~0Int) 0))) (.cse4 (<= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_#res#1Int| 0)) (.cse5 (= (+ (- 2) ~M_E~0Int) 0)) (.cse6 (= ~t1_i~0Int 1)) (.cse7 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp~1#1Int| 0)) (.cse8 (= ~m_pc~0Int 0)) (.cse9 (<= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_~__retres1~0#1Int| 0)) (.cse10 (<= 2 ~T1_E~0Int)) (.cse11 (= 0 ~t1_st~0Int))) (or (and (= (+ (- 2) ~m_st~0Int) 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and (<= |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp___0~0#1Int| 0) .cse0 (= (+ (* (- 1) ~local~0Int) ~token~0Int) 0) (= 0 ~m_st~0Int) .cse1 .cse2 .cse3 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_#res#1Int| 0) .cse4 .cse5 .cse6 .cse7 .cse8 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp___0~0#1Int| 1)) .cse9 .cse10 .cse11 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_~__retres1~1#1Int| 0)))) [2022-01-11 00:17:00,914 INFO L858 garLoopResultBuilder]: For program point L287(lines 287 291) no Hoare annotation was computed. [2022-01-11 00:17:00,914 INFO L858 garLoopResultBuilder]: For program point L287-2(lines 286 309) no Hoare annotation was computed. [2022-01-11 00:17:00,914 INFO L858 garLoopResultBuilder]: For program point L292-1(lines 286 309) no Hoare annotation was computed. [2022-01-11 00:17:00,914 INFO L858 garLoopResultBuilder]: For program point L297-1(lines 286 309) no Hoare annotation was computed. [2022-01-11 00:17:00,914 INFO L854 garLoopResultBuilder]: At program point L302-1(lines 283 310) the Hoare annotation is: (let ((.cse0 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp~1#1Int| 1))) (.cse1 (<= 2 ~E_1~0Int)) (.cse2 (<= 2 ~E_M~0Int)) (.cse3 (not (= (+ (- 1) ~t1_pc~0Int) 0))) (.cse4 (<= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_#res#1Int| 0)) (.cse5 (= (+ (- 2) ~M_E~0Int) 0)) (.cse6 (= ~t1_i~0Int 1)) (.cse7 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp~1#1Int| 0)) (.cse8 (= ~m_pc~0Int 0)) (.cse9 (<= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_~__retres1~0#1Int| 0)) (.cse10 (<= 2 ~T1_E~0Int)) (.cse11 (= 0 ~t1_st~0Int))) (or (and (= (+ (- 2) ~m_st~0Int) 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and (<= |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp___0~0#1Int| 0) .cse0 (= (+ (* (- 1) ~local~0Int) ~token~0Int) 0) (= 0 ~m_st~0Int) .cse1 .cse2 .cse3 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_#res#1Int| 0) .cse4 .cse5 .cse6 .cse7 .cse8 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp___0~0#1Int| 1)) .cse9 .cse10 .cse11 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_~__retres1~1#1Int| 0)))) [2022-01-11 00:17:00,915 INFO L854 garLoopResultBuilder]: At program point L428-2(lines 428 465) the Hoare annotation is: (let ((.cse17 (= ~t1_pc~0Int 1))) (let ((.cse0 (not .cse17)) (.cse15 (= ~local~0Int ~token~0Int)) (.cse1 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp___0~0#1Int| 0)) (.cse16 (<= 2 ~t1_st~0Int)) (.cse19 (= 0 ~m_st~0Int)) (.cse6 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_#res#1Int| 0)) (.cse10 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp___0~0#1Int| 1))) (.cse14 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_~__retres1~1#1Int| 0)) (.cse2 (= 2 ~m_st~0Int)) (.cse3 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp~1#1Int| 1))) (.cse4 (<= 2 ~E_1~0Int)) (.cse5 (<= 2 ~E_M~0Int)) (.cse7 (<= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_#res#1Int| 0)) (.cse8 (= ~t1_i~0Int 1)) (.cse9 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp~1#1Int| 0)) (.cse18 (= ~m_pc~0Int 0)) (.cse11 (<= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_~__retres1~0#1Int| 0)) (.cse12 (<= 2 ~T1_E~0Int)) (.cse13 (= 0 ~t1_st~0Int))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse1 .cse2 .cse15 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse1 .cse2 .cse3 .cse16 .cse17 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14) (and .cse2 .cse3 .cse16 .cse17 .cse4 .cse5 .cse7 .cse8 .cse9 .cse18 .cse11 .cse12) (and .cse1 .cse15 .cse3 .cse16 .cse17 .cse19 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse18 .cse10 .cse11 .cse12 .cse14) (and .cse0 .cse1 .cse15 .cse3 .cse19 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse18 .cse10 .cse11 .cse12 .cse13 .cse14) (let ((.cse20 (+ ~local~0Int 1))) (let ((.cse21 (+ ~token~0Int (* (div .cse20 4294967296) 4294967296)))) (and (<= .cse20 .cse21) .cse1 .cse3 .cse16 .cse17 .cse19 .cse4 .cse5 .cse6 .cse7 .cse8 (< .cse21 (+ ~local~0Int 2)) .cse9 .cse10 .cse11 .cse12 .cse14))) (and .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse18 .cse11 .cse12 .cse13)))) [2022-01-11 00:17:00,915 INFO L861 garLoopResultBuilder]: At program point L466(lines 413 471) the Hoare annotation is: true [2022-01-11 00:17:00,915 INFO L858 garLoopResultBuilder]: For program point L429(line 429) no Hoare annotation was computed. [2022-01-11 00:17:00,915 INFO L861 garLoopResultBuilder]: At program point L481(lines 472 483) the Hoare annotation is: true [2022-01-11 00:17:00,916 INFO L854 garLoopResultBuilder]: At program point L234(lines 210 248) the Hoare annotation is: (let ((.cse16 (= ~t1_pc~0Int 1))) (let ((.cse0 (not .cse16)) (.cse18 (= ~local~0Int ~token~0Int)) (.cse1 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp___0~0#1Int| 0)) (.cse15 (<= 2 ~t1_st~0Int)) (.cse19 (= 0 ~m_st~0Int)) (.cse6 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_#res#1Int| 0)) (.cse10 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp___0~0#1Int| 1))) (.cse14 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_~__retres1~1#1Int| 0)) (.cse2 (= 2 ~m_st~0Int)) (.cse3 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp~1#1Int| 1))) (.cse4 (<= 2 ~E_1~0Int)) (.cse5 (<= 2 ~E_M~0Int)) (.cse7 (<= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_#res#1Int| 0)) (.cse8 (= ~t1_i~0Int 1)) (.cse9 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp~1#1Int| 0)) (.cse17 (= ~m_pc~0Int 0)) (.cse11 (<= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_~__retres1~0#1Int| 0)) (.cse12 (<= 2 ~T1_E~0Int)) (.cse13 (= 0 ~t1_st~0Int))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse2 .cse3 .cse15 .cse16 .cse4 .cse5 .cse7 .cse8 .cse9 .cse17 .cse11 .cse12) (and .cse1 .cse18 .cse3 .cse15 .cse16 .cse19 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse17 .cse10 .cse11 .cse12 .cse14) (and .cse0 .cse1 .cse18 .cse3 .cse19 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse17 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse2 .cse18 .cse3 .cse16 .cse4 .cse5 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13) (and .cse1 .cse2 .cse3 .cse15 .cse16 .cse4 .cse5 .cse8 .cse9 .cse10 .cse12) (let ((.cse20 (+ ~local~0Int 1))) (let ((.cse21 (+ ~token~0Int (* (div .cse20 4294967296) 4294967296)))) (and (<= .cse20 .cse21) .cse1 .cse15 .cse16 .cse19 .cse4 .cse5 .cse6 .cse8 (< .cse21 (+ ~local~0Int 2)) .cse10 .cse12 .cse14))) (and .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse17 .cse11 .cse12 .cse13)))) [2022-01-11 00:17:00,916 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-01-11 00:17:00,917 INFO L854 garLoopResultBuilder]: At program point L249(lines 204 254) the Hoare annotation is: (let ((.cse16 (= ~t1_pc~0Int 1))) (let ((.cse0 (not .cse16)) (.cse18 (= ~local~0Int ~token~0Int)) (.cse1 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp___0~0#1Int| 0)) (.cse15 (<= 2 ~t1_st~0Int)) (.cse19 (= 0 ~m_st~0Int)) (.cse6 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_#res#1Int| 0)) (.cse10 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp___0~0#1Int| 1))) (.cse14 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_~__retres1~1#1Int| 0)) (.cse2 (= 2 ~m_st~0Int)) (.cse3 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp~1#1Int| 1))) (.cse4 (<= 2 ~E_1~0Int)) (.cse5 (<= 2 ~E_M~0Int)) (.cse7 (<= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_#res#1Int| 0)) (.cse8 (= ~t1_i~0Int 1)) (.cse9 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp~1#1Int| 0)) (.cse17 (= ~m_pc~0Int 0)) (.cse11 (<= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_~__retres1~0#1Int| 0)) (.cse12 (<= 2 ~T1_E~0Int)) (.cse13 (= 0 ~t1_st~0Int))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse2 .cse3 .cse15 .cse16 .cse4 .cse5 .cse7 .cse8 .cse9 .cse17 .cse11 .cse12) (and .cse1 .cse18 .cse3 .cse15 .cse16 .cse19 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse17 .cse10 .cse11 .cse12 .cse14) (and .cse0 .cse1 .cse18 .cse3 .cse19 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse17 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse2 .cse18 .cse3 .cse16 .cse4 .cse5 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13) (and .cse1 .cse2 .cse3 .cse15 .cse16 .cse4 .cse5 .cse8 .cse9 .cse10 .cse12) (let ((.cse20 (+ ~local~0Int 1))) (let ((.cse21 (+ ~token~0Int (* (div .cse20 4294967296) 4294967296)))) (and (<= .cse20 .cse21) .cse1 .cse15 .cse16 .cse19 .cse4 .cse5 .cse6 .cse8 (< .cse21 (+ ~local~0Int 2)) .cse10 .cse12 .cse14))) (and .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse17 .cse11 .cse12 .cse13)))) [2022-01-11 00:17:00,917 INFO L858 garLoopResultBuilder]: For program point L211(line 211) no Hoare annotation was computed. [2022-01-11 00:17:00,917 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-01-11 00:17:00,917 INFO L854 garLoopResultBuilder]: At program point L163-1(lines 158 165) the Hoare annotation is: (let ((.cse16 (= ~t1_pc~0Int 1))) (let ((.cse0 (not .cse16)) (.cse18 (= ~local~0Int ~token~0Int)) (.cse1 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp___0~0#1Int| 0)) (.cse15 (<= 2 ~t1_st~0Int)) (.cse19 (= 0 ~m_st~0Int)) (.cse6 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_#res#1Int| 0)) (.cse10 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp___0~0#1Int| 1))) (.cse14 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_~__retres1~1#1Int| 0)) (.cse2 (= 2 ~m_st~0Int)) (.cse3 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp~1#1Int| 1))) (.cse4 (<= 2 ~E_1~0Int)) (.cse5 (<= 2 ~E_M~0Int)) (.cse7 (<= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_#res#1Int| 0)) (.cse8 (= ~t1_i~0Int 1)) (.cse9 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp~1#1Int| 0)) (.cse17 (= ~m_pc~0Int 0)) (.cse11 (<= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_~__retres1~0#1Int| 0)) (.cse12 (<= 2 ~T1_E~0Int)) (.cse13 (= 0 ~t1_st~0Int))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse2 .cse3 .cse15 .cse16 .cse4 .cse5 .cse7 .cse8 .cse9 .cse17 .cse11 .cse12) (and .cse1 .cse18 .cse3 .cse15 .cse16 .cse19 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse17 .cse10 .cse11 .cse12 .cse14) (and .cse0 .cse1 .cse18 .cse3 .cse19 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse17 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse2 .cse18 .cse3 .cse16 .cse4 .cse5 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13) (and .cse1 .cse2 .cse3 .cse15 .cse16 .cse4 .cse5 .cse8 .cse9 .cse10 .cse12) (let ((.cse20 (+ ~local~0Int 1))) (let ((.cse21 (+ ~token~0Int (* (div .cse20 4294967296) 4294967296)))) (and (<= .cse20 .cse21) .cse1 .cse15 .cse16 .cse19 .cse4 .cse5 .cse6 .cse8 (< .cse21 (+ ~local~0Int 2)) .cse10 .cse12 .cse14))) (and .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse17 .cse11 .cse12 .cse13)))) [2022-01-11 00:17:00,917 INFO L858 garLoopResultBuilder]: For program point L188(lines 188 198) no Hoare annotation was computed. [2022-01-11 00:17:00,918 INFO L858 garLoopResultBuilder]: For program point L259-3(lines 259 263) no Hoare annotation was computed. [2022-01-11 00:17:00,918 INFO L854 garLoopResultBuilder]: At program point L200(lines 187 202) the Hoare annotation is: (let ((.cse16 (= ~t1_pc~0Int 1))) (let ((.cse0 (not .cse16)) (.cse18 (= ~local~0Int ~token~0Int)) (.cse1 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp___0~0#1Int| 0)) (.cse15 (<= 2 ~t1_st~0Int)) (.cse19 (= 0 ~m_st~0Int)) (.cse6 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_#res#1Int| 0)) (.cse10 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp___0~0#1Int| 1))) (.cse14 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_~__retres1~1#1Int| 0)) (.cse2 (= 2 ~m_st~0Int)) (.cse3 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp~1#1Int| 1))) (.cse4 (<= 2 ~E_1~0Int)) (.cse5 (<= 2 ~E_M~0Int)) (.cse7 (<= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_#res#1Int| 0)) (.cse8 (= ~t1_i~0Int 1)) (.cse9 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp~1#1Int| 0)) (.cse17 (= ~m_pc~0Int 0)) (.cse11 (<= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_~__retres1~0#1Int| 0)) (.cse12 (<= 2 ~T1_E~0Int)) (.cse13 (= 0 ~t1_st~0Int))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse2 .cse3 .cse15 .cse16 .cse4 .cse5 .cse7 .cse8 .cse9 .cse17 .cse11 .cse12) (and .cse1 .cse18 .cse3 .cse15 .cse16 .cse19 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse17 .cse10 .cse11 .cse12 .cse14) (and .cse0 .cse1 .cse18 .cse3 .cse19 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse17 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse2 .cse18 .cse3 .cse16 .cse4 .cse5 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13) (and .cse1 .cse2 .cse3 .cse15 .cse16 .cse4 .cse5 .cse8 .cse9 .cse10 .cse12) (let ((.cse20 (+ ~local~0Int 1))) (let ((.cse21 (+ ~token~0Int (* (div .cse20 4294967296) 4294967296)))) (and (<= .cse20 .cse21) .cse1 .cse15 .cse16 .cse19 .cse4 .cse5 .cse6 .cse8 (< .cse21 (+ ~local~0Int 2)) .cse10 .cse12 .cse14))) (and .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse17 .cse11 .cse12 .cse13)))) [2022-01-11 00:17:00,918 INFO L858 garLoopResultBuilder]: For program point L192(lines 192 197) no Hoare annotation was computed. [2022-01-11 00:17:00,918 INFO L858 garLoopResultBuilder]: For program point L259-5(lines 258 281) no Hoare annotation was computed. [2022-01-11 00:17:00,918 INFO L854 garLoopResultBuilder]: At program point L201(lines 184 203) the Hoare annotation is: (let ((.cse16 (= ~t1_pc~0Int 1))) (let ((.cse0 (not .cse16)) (.cse18 (= ~local~0Int ~token~0Int)) (.cse1 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp___0~0#1Int| 0)) (.cse15 (<= 2 ~t1_st~0Int)) (.cse19 (= 0 ~m_st~0Int)) (.cse6 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_#res#1Int| 0)) (.cse10 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp___0~0#1Int| 1))) (.cse14 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_~__retres1~1#1Int| 0)) (.cse2 (= 2 ~m_st~0Int)) (.cse3 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp~1#1Int| 1))) (.cse4 (<= 2 ~E_1~0Int)) (.cse5 (<= 2 ~E_M~0Int)) (.cse7 (<= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_#res#1Int| 0)) (.cse8 (= ~t1_i~0Int 1)) (.cse9 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp~1#1Int| 0)) (.cse17 (= ~m_pc~0Int 0)) (.cse11 (<= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_~__retres1~0#1Int| 0)) (.cse12 (<= 2 ~T1_E~0Int)) (.cse13 (= 0 ~t1_st~0Int))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse2 .cse3 .cse15 .cse16 .cse4 .cse5 .cse7 .cse8 .cse9 .cse17 .cse11 .cse12) (and .cse1 .cse18 .cse3 .cse15 .cse16 .cse19 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse17 .cse10 .cse11 .cse12 .cse14) (and .cse0 .cse1 .cse18 .cse3 .cse19 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse17 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse2 .cse18 .cse3 .cse16 .cse4 .cse5 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13) (and .cse1 .cse2 .cse3 .cse15 .cse16 .cse4 .cse5 .cse8 .cse9 .cse10 .cse12) (let ((.cse20 (+ ~local~0Int 1))) (let ((.cse21 (+ ~token~0Int (* (div .cse20 4294967296) 4294967296)))) (and (<= .cse20 .cse21) .cse1 .cse15 .cse16 .cse19 .cse4 .cse5 .cse6 .cse8 (< .cse21 (+ ~local~0Int 2)) .cse10 .cse12 .cse14))) (and .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse17 .cse11 .cse12 .cse13)))) [2022-01-11 00:17:00,918 INFO L858 garLoopResultBuilder]: For program point L264-3(lines 258 281) no Hoare annotation was computed. [2022-01-11 00:17:00,919 INFO L858 garLoopResultBuilder]: For program point L215(lines 215 219) no Hoare annotation was computed. [2022-01-11 00:17:00,919 INFO L858 garLoopResultBuilder]: For program point L269-3(lines 258 281) no Hoare annotation was computed. [2022-01-11 00:17:00,920 INFO L858 garLoopResultBuilder]: For program point L215-1(lines 210 248) no Hoare annotation was computed. [2022-01-11 00:17:00,920 INFO L854 garLoopResultBuilder]: At program point L274-3(lines 255 282) the Hoare annotation is: (let ((.cse16 (= ~t1_pc~0Int 1))) (let ((.cse0 (not .cse16)) (.cse18 (= ~local~0Int ~token~0Int)) (.cse1 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp___0~0#1Int| 0)) (.cse15 (<= 2 ~t1_st~0Int)) (.cse19 (= 0 ~m_st~0Int)) (.cse6 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_#res#1Int| 0)) (.cse10 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp___0~0#1Int| 1))) (.cse14 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_~__retres1~1#1Int| 0)) (.cse2 (= 2 ~m_st~0Int)) (.cse3 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp~1#1Int| 1))) (.cse4 (<= 2 ~E_1~0Int)) (.cse5 (<= 2 ~E_M~0Int)) (.cse7 (<= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_#res#1Int| 0)) (.cse8 (= ~t1_i~0Int 1)) (.cse9 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp~1#1Int| 0)) (.cse17 (= ~m_pc~0Int 0)) (.cse11 (<= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_~__retres1~0#1Int| 0)) (.cse12 (<= 2 ~T1_E~0Int)) (.cse13 (= 0 ~t1_st~0Int))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse2 .cse3 .cse15 .cse16 .cse4 .cse5 .cse7 .cse8 .cse9 .cse17 .cse11 .cse12) (and .cse1 .cse18 .cse3 .cse15 .cse16 .cse19 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse17 .cse10 .cse11 .cse12 .cse14) (and .cse0 .cse1 .cse18 .cse3 .cse19 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse17 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse2 .cse18 .cse3 .cse16 .cse4 .cse5 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13) (and .cse1 .cse2 .cse3 .cse15 .cse16 .cse4 .cse5 .cse8 .cse9 .cse10 .cse12) (let ((.cse20 (+ ~local~0Int 1))) (let ((.cse21 (+ ~token~0Int (* (div .cse20 4294967296) 4294967296)))) (and (<= .cse20 .cse21) .cse1 .cse15 .cse16 .cse19 .cse4 .cse5 .cse6 .cse8 (< .cse21 (+ ~local~0Int 2)) .cse10 .cse12 .cse14))) (and .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse17 .cse11 .cse12 .cse13)))) [2022-01-11 00:17:00,920 INFO L858 garLoopResultBuilder]: For program point L223(lines 223 230) no Hoare annotation was computed. [2022-01-11 00:17:00,920 INFO L858 garLoopResultBuilder]: For program point L220(lines 210 248) no Hoare annotation was computed. [2022-01-11 00:17:00,920 INFO L858 garLoopResultBuilder]: For program point L124-9(lines 124 133) no Hoare annotation was computed. [2022-01-11 00:17:00,920 INFO L858 garLoopResultBuilder]: For program point L44(lines 44 52) no Hoare annotation was computed. [2022-01-11 00:17:00,920 INFO L858 garLoopResultBuilder]: For program point L237(lines 237 244) no Hoare annotation was computed. [2022-01-11 00:17:00,920 INFO L858 garLoopResultBuilder]: For program point L125-3(lines 125 130) no Hoare annotation was computed. [2022-01-11 00:17:00,920 INFO L858 garLoopResultBuilder]: For program point L124-11(lines 124 133) no Hoare annotation was computed. [2022-01-11 00:17:00,921 INFO L854 garLoopResultBuilder]: At program point L69-1(lines 43 82) the Hoare annotation is: (let ((.cse7 (= ~m_pc~0Int 0)) (.cse0 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp___0~0#1Int| 0)) (.cse1 (<= 2 ~t1_st~0Int)) (.cse2 (= ~t1_pc~0Int 1)) (.cse3 (<= 2 ~E_1~0Int)) (.cse4 (<= 2 ~E_M~0Int)) (.cse5 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_#res#1Int| 0)) (.cse6 (= ~t1_i~0Int 1)) (.cse8 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp___0~0#1Int| 1))) (.cse9 (<= 2 ~T1_E~0Int)) (.cse10 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_~__retres1~1#1Int| 0))) (or (and .cse0 (= ~local~0Int ~token~0Int) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and (not .cse2) .cse0 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp~1#1Int| 1)) .cse3 .cse4 .cse5 (<= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_#res#1Int| 0) .cse6 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp~1#1Int| 0) .cse7 .cse8 (<= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_~__retres1~0#1Int| 0) .cse9 (= 0 ~t1_st~0Int) .cse10) (let ((.cse11 (+ ~local~0Int 1))) (let ((.cse12 (+ ~token~0Int (* (div .cse11 4294967296) 4294967296)))) (and (<= .cse11 .cse12) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (< .cse12 (+ ~local~0Int 2)) .cse8 .cse9 .cse10))))) [2022-01-11 00:17:00,921 INFO L858 garLoopResultBuilder]: For program point L47(lines 47 51) no Hoare annotation was computed. [2022-01-11 00:17:00,921 INFO L858 garLoopResultBuilder]: For program point L88(lines 88 96) no Hoare annotation was computed. [2022-01-11 00:17:00,921 INFO L854 garLoopResultBuilder]: At program point L135-3(lines 123 137) the Hoare annotation is: (let ((.cse2 (= ~t1_pc~0Int 1))) (let ((.cse14 (not .cse2)) (.cse1 (= ~local~0Int ~token~0Int)) (.cse12 (= ~m_pc~0Int 0)) (.cse8 (= 0 ~t1_st~0Int)) (.cse10 (= 0 ~m_st~0Int)) (.cse11 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_#res#1Int| 0)) (.cse13 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_~__retres1~1#1Int| 0)) (.cse0 (= 2 ~m_st~0Int)) (.cse9 (<= 2 ~t1_st~0Int)) (.cse3 (<= 2 ~E_1~0Int)) (.cse4 (<= 2 ~E_M~0Int)) (.cse5 (= ~t1_i~0Int 1)) (.cse6 (<= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_~__retres1~0#1Int| 0)) (.cse7 (<= 2 ~T1_E~0Int))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse1 .cse9 .cse2 .cse10 .cse3 .cse4 .cse11 .cse5 .cse12 .cse6 .cse7 .cse13) (and .cse0 .cse3 .cse4 .cse5 .cse12 .cse6 .cse7 .cse8) (and .cse14 .cse0 .cse3 .cse4 .cse11 .cse5 .cse6 .cse7 .cse8 .cse13) (and .cse14 .cse1 .cse10 .cse3 .cse4 .cse11 .cse5 .cse12 .cse6 .cse7 .cse8 .cse13) (let ((.cse15 (+ ~local~0Int 1))) (let ((.cse16 (+ ~token~0Int (* (div .cse15 4294967296) 4294967296)))) (and (<= .cse15 .cse16) .cse9 .cse2 .cse10 .cse3 .cse4 .cse11 .cse5 (< .cse16 (+ ~local~0Int 2)) .cse6 .cse7 .cse13))) (and .cse0 .cse9 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7)))) [2022-01-11 00:17:00,921 INFO L854 garLoopResultBuilder]: At program point L77(lines 40 83) the Hoare annotation is: (let ((.cse12 (= 0 ~t1_st~0Int)) (.cse1 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp___0~0#1Int| 0)) (.cse2 (= 2 ~m_st~0Int)) (.cse3 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp~1#1Int| 1))) (.cse0 (= ~t1_pc~0Int 1)) (.cse4 (<= 2 ~E_1~0Int)) (.cse5 (<= 2 ~E_M~0Int)) (.cse6 (<= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_#res#1Int| 0)) (.cse7 (= ~t1_i~0Int 1)) (.cse8 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp~1#1Int| 0)) (.cse9 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp___0~0#1Int| 1))) (.cse10 (<= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_~__retres1~0#1Int| 0)) (.cse11 (<= 2 ~T1_E~0Int))) (or (and (not .cse0) .cse1 .cse2 .cse3 .cse4 .cse5 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_#res#1Int| 0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_~__retres1~1#1Int| 0)) (and .cse2 (= ~local~0Int ~token~0Int) .cse3 .cse0 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12) (and .cse1 .cse2 .cse3 (<= 2 ~t1_st~0Int) .cse0 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11))) [2022-01-11 00:17:00,921 INFO L858 garLoopResultBuilder]: For program point L56(line 56) no Hoare annotation was computed. [2022-01-11 00:17:00,921 INFO L854 garLoopResultBuilder]: At program point L48(lines 43 82) the Hoare annotation is: (let ((.cse0 (+ ~local~0Int 1))) (let ((.cse1 (+ ~token~0Int (* (div .cse0 4294967296) 4294967296)))) (and (<= .cse0 .cse1) (<= |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp___0~0#1Int| 0) (<= 2 ~t1_st~0Int) (= ~t1_pc~0Int 1) (<= 2 ~E_1~0Int) (<= 2 ~E_M~0Int) (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_#res#1Int| 0) (= ~t1_i~0Int 1) (< .cse1 (+ ~local~0Int 2)) (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp___0~0#1Int| 1)) (<= 2 ~T1_E~0Int) (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_~__retres1~1#1Int| 0)))) [2022-01-11 00:17:00,921 INFO L854 garLoopResultBuilder]: At program point L99-1(lines 87 118) the Hoare annotation is: (let ((.cse0 (= 2 ~m_st~0Int)) (.cse1 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp~1#1Int| 1))) (.cse4 (<= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_#res#1Int| 0)) (.cse6 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp~1#1Int| 0)) (.cse7 (= ~m_pc~0Int 0)) (.cse8 (<= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_~__retres1~0#1Int| 0)) (.cse10 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp___0~0#1Int| 0)) (.cse14 (= 0 ~m_st~0Int)) (.cse2 (<= 2 ~E_1~0Int)) (.cse3 (<= 2 ~E_M~0Int)) (.cse11 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_#res#1Int| 0)) (.cse5 (= ~t1_i~0Int 1)) (.cse12 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp___0~0#1Int| 1))) (.cse9 (<= 2 ~T1_E~0Int)) (.cse13 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_~__retres1~1#1Int| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse10 .cse0 .cse1 .cse2 .cse3 .cse11 .cse5 .cse6 .cse12 .cse9 .cse13) (and .cse10 (= ~local~0Int ~token~0Int) .cse1 .cse14 .cse2 .cse3 .cse11 .cse4 .cse5 .cse6 .cse7 .cse12 .cse8 .cse9 .cse13) (let ((.cse15 (+ ~local~0Int 1))) (let ((.cse16 (+ ~token~0Int (* (div .cse15 4294967296) 4294967296)))) (and (<= .cse15 .cse16) .cse10 .cse14 .cse2 .cse3 .cse11 .cse5 (< .cse16 (+ ~local~0Int 2)) .cse12 .cse9 .cse13))))) [2022-01-11 00:17:00,921 INFO L858 garLoopResultBuilder]: For program point L91(lines 91 95) no Hoare annotation was computed. [2022-01-11 00:17:00,922 INFO L854 garLoopResultBuilder]: At program point L136-3(lines 120 138) the Hoare annotation is: (let ((.cse13 (= ~t1_pc~0Int 1))) (let ((.cse0 (not .cse13)) (.cse11 (= ~m_pc~0Int 0)) (.cse1 (= 2 ~m_st~0Int)) (.cse14 (= ~local~0Int ~token~0Int)) (.cse9 (= 0 ~t1_st~0Int)) (.cse12 (<= 2 ~t1_st~0Int)) (.cse15 (= 0 ~m_st~0Int)) (.cse2 (<= 2 ~E_1~0Int)) (.cse3 (<= 2 ~E_M~0Int)) (.cse4 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_#res#1Int| 0)) (.cse5 (<= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_#res#1Int| 0)) (.cse6 (= ~t1_i~0Int 1)) (.cse7 (<= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_~__retres1~0#1Int| 0)) (.cse8 (<= 2 ~T1_E~0Int)) (.cse10 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_~__retres1~1#1Int| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse1 .cse2 .cse3 .cse5 .cse6 .cse11 .cse7 .cse8 .cse9) (and .cse1 .cse12 .cse13 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse14 .cse15 .cse2 .cse3 .cse4 .cse5 .cse6 .cse11 .cse7 .cse8 .cse9 .cse10) (and .cse14 .cse12 .cse13 .cse15 .cse2 .cse3 .cse4 .cse5 .cse6 .cse11 .cse7 .cse8 .cse10) (and .cse1 .cse14 .cse13 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9) (let ((.cse16 (+ ~local~0Int 1))) (let ((.cse17 (+ ~token~0Int (* (div .cse16 4294967296) 4294967296)))) (and (<= .cse16 .cse17) .cse12 .cse13 .cse15 .cse2 .cse3 .cse4 .cse5 .cse6 (< .cse17 (+ ~local~0Int 2)) .cse7 .cse8 .cse10)))))) [2022-01-11 00:17:00,922 INFO L858 garLoopResultBuilder]: For program point L124-3(lines 124 133) no Hoare annotation was computed. [2022-01-11 00:17:00,923 INFO L858 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2022-01-11 00:17:00,923 INFO L854 garLoopResultBuilder]: At program point L113(lines 84 119) the Hoare annotation is: (let ((.cse1 (= 2 ~m_st~0Int)) (.cse2 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp~1#1Int| 1))) (.cse13 (<= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_#res#1Int| 0)) (.cse9 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp~1#1Int| 0)) (.cse14 (= ~m_pc~0Int 0)) (.cse15 (<= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_~__retres1~0#1Int| 0)) (.cse0 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp___0~0#1Int| 0)) (.cse3 (<= 2 ~t1_st~0Int)) (.cse4 (= ~t1_pc~0Int 1)) (.cse16 (= 0 ~m_st~0Int)) (.cse5 (<= 2 ~E_1~0Int)) (.cse6 (<= 2 ~E_M~0Int)) (.cse7 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_#res#1Int| 0)) (.cse8 (= ~t1_i~0Int 1)) (.cse10 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp___0~0#1Int| 1))) (.cse11 (<= 2 ~T1_E~0Int)) (.cse12 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_~__retres1~1#1Int| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse13 .cse8 .cse9 .cse14 .cse15 .cse11) (and .cse0 (= ~local~0Int ~token~0Int) .cse2 .cse3 .cse4 .cse16 .cse5 .cse6 .cse7 .cse13 .cse8 .cse9 .cse14 .cse10 .cse15 .cse11 .cse12) (let ((.cse17 (+ ~local~0Int 1))) (let ((.cse18 (+ ~token~0Int (* (div .cse17 4294967296) 4294967296)))) (and (<= .cse17 .cse18) .cse0 .cse3 .cse4 .cse16 .cse5 .cse6 .cse7 .cse8 (< .cse18 (+ ~local~0Int 2)) .cse10 .cse11 .cse12))))) [2022-01-11 00:17:00,923 INFO L858 garLoopResultBuilder]: For program point L100(line 100) no Hoare annotation was computed. [2022-01-11 00:17:00,923 INFO L854 garLoopResultBuilder]: At program point L92(lines 87 118) the Hoare annotation is: (let ((.cse0 (= 2 ~m_st~0Int)) (.cse1 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp~1#1Int| 1))) (.cse2 (= ~t1_pc~0Int 1)) (.cse3 (<= 2 ~E_1~0Int)) (.cse4 (<= 2 ~E_M~0Int)) (.cse5 (<= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_#res#1Int| 0)) (.cse6 (= ~t1_i~0Int 1)) (.cse7 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp~1#1Int| 0)) (.cse8 (<= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_~__retres1~0#1Int| 0)) (.cse9 (<= 2 ~T1_E~0Int))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= ~m_pc~0Int 0) .cse8 .cse9) (and .cse0 (= ~local~0Int ~token~0Int) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) [2022-01-11 00:17:00,923 INFO L858 garLoopResultBuilder]: For program point L319-9(lines 319 323) no Hoare annotation was computed. [2022-01-11 00:17:00,923 INFO L858 garLoopResultBuilder]: For program point L125-1(lines 125 130) no Hoare annotation was computed. [2022-01-11 00:17:00,923 INFO L858 garLoopResultBuilder]: For program point L124-5(lines 124 133) no Hoare annotation was computed. [2022-01-11 00:17:00,923 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 20) no Hoare annotation was computed. [2022-01-11 00:17:00,923 INFO L854 garLoopResultBuilder]: At program point L21(lines 16 23) the Hoare annotation is: false [2022-01-11 00:17:00,924 INFO L858 garLoopResultBuilder]: For program point L124-6(lines 124 133) no Hoare annotation was computed. [2022-01-11 00:17:00,924 INFO L858 garLoopResultBuilder]: For program point L319-11(lines 319 323) no Hoare annotation was computed. [2022-01-11 00:17:00,924 INFO L854 garLoopResultBuilder]: At program point L135-1(lines 123 137) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0Int 1)) (.cse1 (<= 2 ~E_M~0Int)) (.cse2 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_#res#1Int| 0)) (.cse3 (= ~t1_i~0Int 1)) (.cse4 (<= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_~__retres1~0#1Int| 0)) (.cse5 (<= 2 ~T1_E~0Int)) (.cse6 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_~__retres1~1#1Int| 0))) (or (and (= ~local~0Int ~token~0Int) (<= 2 ~t1_st~0Int) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and (not .cse0) .cse1 .cse2 .cse3 .cse4 .cse5 (= 0 ~t1_st~0Int) .cse6))) [2022-01-11 00:17:00,924 INFO L858 garLoopResultBuilder]: For program point L125-2(lines 125 130) no Hoare annotation was computed. [2022-01-11 00:17:00,924 INFO L858 garLoopResultBuilder]: For program point L124-8(lines 124 133) no Hoare annotation was computed. [2022-01-11 00:17:00,925 INFO L858 garLoopResultBuilder]: For program point L143-9(lines 143 152) no Hoare annotation was computed. [2022-01-11 00:17:00,925 INFO L854 garLoopResultBuilder]: At program point L136-1(lines 120 138) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0Int 1)) (.cse1 (<= 2 ~E_M~0Int)) (.cse2 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_#res#1Int| 0)) (.cse3 (<= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_#res#1Int| 0)) (.cse4 (= ~t1_i~0Int 1)) (.cse5 (<= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_~__retres1~0#1Int| 0)) (.cse6 (<= 2 ~T1_E~0Int)) (.cse7 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_~__retres1~1#1Int| 0))) (or (and (not .cse0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= 0 ~t1_st~0Int) .cse7) (and (= ~local~0Int ~token~0Int) (<= 2 ~t1_st~0Int) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7))) [2022-01-11 00:17:00,925 INFO L854 garLoopResultBuilder]: At program point L135-2(lines 123 137) the Hoare annotation is: (let ((.cse2 (= 2 ~m_st~0Int)) (.cse3 (= ~t1_pc~0Int 1)) (.cse4 (<= 2 ~E_1~0Int)) (.cse5 (= ~t1_i~0Int 1)) (.cse6 (<= 2 ~T1_E~0Int))) (or (let ((.cse0 (+ ~local~0Int 1))) (let ((.cse1 (+ ~token~0Int (* (div .cse0 4294967296) 4294967296)))) (and (<= .cse0 .cse1) .cse2 .cse3 .cse4 .cse5 (< .cse1 (+ ~local~0Int 2)) .cse6))) (and .cse2 .cse3 .cse4 .cse5 (<= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_~__retres1~0#1Int| 0) .cse6))) [2022-01-11 00:17:00,925 INFO L858 garLoopResultBuilder]: For program point L144-3(lines 144 149) no Hoare annotation was computed. [2022-01-11 00:17:00,925 INFO L858 garLoopResultBuilder]: For program point L143-11(lines 143 152) no Hoare annotation was computed. [2022-01-11 00:17:00,925 INFO L858 garLoopResultBuilder]: For program point L319-3(lines 319 323) no Hoare annotation was computed. [2022-01-11 00:17:00,925 INFO L854 garLoopResultBuilder]: At program point L136-2(lines 120 138) the Hoare annotation is: (let ((.cse2 (= 2 ~m_st~0Int)) (.cse3 (= ~t1_pc~0Int 1)) (.cse4 (<= 2 ~E_1~0Int)) (.cse5 (= ~t1_i~0Int 1)) (.cse6 (<= 2 ~T1_E~0Int))) (or (let ((.cse0 (+ ~local~0Int 1))) (let ((.cse1 (+ ~token~0Int (* (div .cse0 4294967296) 4294967296)))) (and (<= .cse0 .cse1) .cse2 .cse3 .cse4 .cse5 (< .cse1 (+ ~local~0Int 2)) .cse6))) (and .cse2 .cse3 .cse4 (<= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_#res#1Int| 0) .cse5 (<= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_~__retres1~0#1Int| 0) .cse6))) [2022-01-11 00:17:00,925 INFO L854 garLoopResultBuilder]: At program point L154-3(lines 142 156) the Hoare annotation is: (let ((.cse14 (= ~t1_pc~0Int 1))) (let ((.cse0 (not .cse14)) (.cse12 (= ~local~0Int ~token~0Int)) (.cse13 (<= 2 ~t1_st~0Int)) (.cse18 (= 0 ~m_st~0Int)) (.cse11 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_~__retres1~1#1Int| 0)) (.cse1 (= 2 ~m_st~0Int)) (.cse2 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp~1#1Int| 1))) (.cse3 (<= 2 ~E_1~0Int)) (.cse4 (<= 2 ~E_M~0Int)) (.cse5 (<= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_#res#1Int| 0)) (.cse6 (= ~t1_i~0Int 1)) (.cse7 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp~1#1Int| 0)) (.cse15 (= ~m_pc~0Int 0)) (.cse8 (<= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_~__retres1~0#1Int| 0)) (.cse9 (<= 2 ~T1_E~0Int)) (.cse10 (= 0 ~t1_st~0Int))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse1 .cse12 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse1 .cse2 .cse13 .cse14 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11) (and .cse1 .cse2 .cse13 .cse14 .cse3 .cse4 .cse5 .cse6 .cse7 .cse15 .cse8 .cse9) (let ((.cse16 (+ ~local~0Int 1))) (let ((.cse17 (+ ~token~0Int (* (div .cse16 4294967296) 4294967296)))) (and (<= .cse16 .cse17) .cse2 .cse13 .cse14 .cse18 .cse3 .cse4 .cse5 .cse6 (< .cse17 (+ ~local~0Int 2)) .cse7 .cse8 .cse9 .cse11))) (and .cse0 .cse12 .cse2 .cse18 .cse3 .cse4 .cse5 .cse6 .cse7 .cse15 .cse8 .cse9 .cse10 .cse11) (and .cse12 .cse2 .cse13 .cse14 .cse18 .cse3 .cse4 .cse5 .cse6 .cse7 .cse15 .cse8 .cse9 .cse11) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse15 .cse8 .cse9 .cse10)))) [2022-01-11 00:17:00,925 INFO L858 garLoopResultBuilder]: For program point L319-5(lines 319 323) no Hoare annotation was computed. [2022-01-11 00:17:00,925 INFO L858 garLoopResultBuilder]: For program point L319-6(lines 319 323) no Hoare annotation was computed. [2022-01-11 00:17:00,926 INFO L854 garLoopResultBuilder]: At program point L155-3(lines 139 157) the Hoare annotation is: (let ((.cse17 (= ~t1_pc~0Int 1))) (let ((.cse1 (= ~local~0Int ~token~0Int)) (.cse0 (not .cse17)) (.cse15 (= 2 ~m_st~0Int)) (.cse10 (= ~m_pc~0Int 0)) (.cse13 (= 0 ~t1_st~0Int)) (.cse2 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp~1#1Int| 1))) (.cse16 (<= 2 ~t1_st~0Int)) (.cse3 (= 0 ~m_st~0Int)) (.cse4 (<= 2 ~E_1~0Int)) (.cse5 (<= 2 ~E_M~0Int)) (.cse6 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_#res#1Int| 0)) (.cse7 (<= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_#res#1Int| 0)) (.cse8 (= ~t1_i~0Int 1)) (.cse9 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp~1#1Int| 0)) (.cse11 (<= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_~__retres1~0#1Int| 0)) (.cse12 (<= 2 ~T1_E~0Int)) (.cse14 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_~__retres1~1#1Int| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse15 .cse2 .cse16 .cse17 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse15 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14) (and .cse15 .cse2 .cse16 .cse17 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse14) (and .cse1 .cse2 .cse16 .cse17 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14) (and .cse0 .cse15 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14) (and .cse15 .cse2 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (let ((.cse18 (+ ~local~0Int 1))) (let ((.cse19 (+ ~token~0Int (* (div .cse18 4294967296) 4294967296)))) (and (<= .cse18 .cse19) .cse2 .cse16 .cse17 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (< .cse19 (+ ~local~0Int 2)) .cse9 .cse11 .cse12 .cse14)))))) [2022-01-11 00:17:00,926 INFO L858 garLoopResultBuilder]: For program point L143-3(lines 143 152) no Hoare annotation was computed. [2022-01-11 00:17:00,926 INFO L858 garLoopResultBuilder]: For program point L319-8(lines 319 323) no Hoare annotation was computed. [2022-01-11 00:17:00,926 INFO L858 garLoopResultBuilder]: For program point L327-9(lines 327 331) no Hoare annotation was computed. [2022-01-11 00:17:00,926 INFO L858 garLoopResultBuilder]: For program point L144-1(lines 144 149) no Hoare annotation was computed. [2022-01-11 00:17:00,926 INFO L858 garLoopResultBuilder]: For program point L143-5(lines 143 152) no Hoare annotation was computed. [2022-01-11 00:17:00,926 INFO L858 garLoopResultBuilder]: For program point L143-6(lines 143 152) no Hoare annotation was computed. [2022-01-11 00:17:00,926 INFO L854 garLoopResultBuilder]: At program point L327-11(lines 311 335) the Hoare annotation is: (let ((.cse17 (= ~t1_pc~0Int 1))) (let ((.cse0 (not .cse17)) (.cse15 (= ~local~0Int ~token~0Int)) (.cse1 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp___0~0#1Int| 0)) (.cse16 (<= 2 ~t1_st~0Int)) (.cse19 (= 0 ~m_st~0Int)) (.cse6 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_#res#1Int| 0)) (.cse10 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp___0~0#1Int| 1))) (.cse14 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_~__retres1~1#1Int| 0)) (.cse2 (= 2 ~m_st~0Int)) (.cse3 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp~1#1Int| 1))) (.cse4 (<= 2 ~E_1~0Int)) (.cse5 (<= 2 ~E_M~0Int)) (.cse7 (<= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_#res#1Int| 0)) (.cse8 (= ~t1_i~0Int 1)) (.cse9 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp~1#1Int| 0)) (.cse18 (= ~m_pc~0Int 0)) (.cse11 (<= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_~__retres1~0#1Int| 0)) (.cse12 (<= 2 ~T1_E~0Int)) (.cse13 (= 0 ~t1_st~0Int))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse1 .cse2 .cse15 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse1 .cse2 .cse3 .cse16 .cse17 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14) (and .cse2 .cse3 .cse16 .cse17 .cse4 .cse5 .cse7 .cse8 .cse9 .cse18 .cse11 .cse12) (and .cse1 .cse15 .cse3 .cse16 .cse17 .cse19 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse18 .cse10 .cse11 .cse12 .cse14) (and .cse0 .cse1 .cse15 .cse3 .cse19 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse18 .cse10 .cse11 .cse12 .cse13 .cse14) (let ((.cse20 (+ ~local~0Int 1))) (let ((.cse21 (+ ~token~0Int (* (div .cse20 4294967296) 4294967296)))) (and (<= .cse20 .cse21) .cse1 .cse3 .cse16 .cse17 .cse19 .cse4 .cse5 .cse6 .cse7 .cse8 (< .cse21 (+ ~local~0Int 2)) .cse9 .cse10 .cse11 .cse12 .cse14))) (and .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse18 .cse11 .cse12 .cse13)))) [2022-01-11 00:17:00,926 INFO L854 garLoopResultBuilder]: At program point L154-1(lines 142 156) the Hoare annotation is: (let ((.cse1 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp~1#1Int| 1))) (.cse9 (<= 2 ~t1_st~0Int)) (.cse0 (= ~t1_pc~0Int 1)) (.cse2 (<= 2 ~E_M~0Int)) (.cse3 (<= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_#res#1Int| 0)) (.cse4 (= ~t1_i~0Int 1)) (.cse5 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp~1#1Int| 0)) (.cse6 (<= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_~__retres1~0#1Int| 0)) (.cse7 (<= 2 ~T1_E~0Int)) (.cse8 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_~__retres1~1#1Int| 0))) (or (and (not .cse0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= 0 ~t1_st~0Int) .cse8) (and (= ~local~0Int ~token~0Int) .cse1 .cse9 .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse1 .cse9 .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8))) [2022-01-11 00:17:00,926 INFO L858 garLoopResultBuilder]: For program point L144-2(lines 144 149) no Hoare annotation was computed. [2022-01-11 00:17:00,927 INFO L858 garLoopResultBuilder]: For program point L143-8(lines 143 152) no Hoare annotation was computed. [2022-01-11 00:17:00,927 INFO L858 garLoopResultBuilder]: For program point L287-3(lines 287 291) no Hoare annotation was computed. [2022-01-11 00:17:00,927 INFO L854 garLoopResultBuilder]: At program point L155-1(lines 139 157) the Hoare annotation is: (let ((.cse1 (<= 2 ~t1_st~0Int)) (.cse2 (= ~t1_pc~0Int 1)) (.cse0 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp~1#1Int| 1))) (.cse3 (<= 2 ~E_M~0Int)) (.cse9 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_#res#1Int| 0)) (.cse4 (<= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_#res#1Int| 0)) (.cse5 (= ~t1_i~0Int 1)) (.cse6 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp~1#1Int| 0)) (.cse7 (<= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_~__retres1~0#1Int| 0)) (.cse8 (<= 2 ~T1_E~0Int)) (.cse10 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_~__retres1~1#1Int| 0))) (or (and (= ~local~0Int ~token~0Int) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse9 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10) (and (not .cse2) .cse0 .cse3 .cse9 .cse4 .cse5 .cse6 .cse7 .cse8 (= 0 ~t1_st~0Int) .cse10))) [2022-01-11 00:17:00,927 INFO L854 garLoopResultBuilder]: At program point L154-2(lines 142 156) the Hoare annotation is: (let ((.cse0 (= 2 ~m_st~0Int)) (.cse1 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp~1#1Int| 1))) (.cse5 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp~1#1Int| 0)) (.cse2 (= ~t1_pc~0Int 1)) (.cse3 (<= 2 ~E_1~0Int)) (.cse4 (= ~t1_i~0Int 1)) (.cse6 (<= 2 ~T1_E~0Int)) (.cse7 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_~__retres1~1#1Int| 0))) (or (and .cse0 .cse1 .cse2 .cse3 (<= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_#res#1Int| 0) .cse4 .cse5 (= ~m_pc~0Int 0) (<= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_~__retres1~0#1Int| 0) .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (let ((.cse8 (+ ~local~0Int 1))) (let ((.cse9 (+ ~token~0Int (* (div .cse8 4294967296) 4294967296)))) (and (<= .cse8 .cse9) .cse2 (= 0 ~m_st~0Int) .cse3 .cse4 (< .cse9 (+ ~local~0Int 2)) .cse6 .cse7))))) [2022-01-11 00:17:00,927 INFO L858 garLoopResultBuilder]: For program point L287-5(lines 286 309) no Hoare annotation was computed. [2022-01-11 00:17:00,927 INFO L858 garLoopResultBuilder]: For program point L327-3(lines 327 331) no Hoare annotation was computed. [2022-01-11 00:17:00,927 INFO L854 garLoopResultBuilder]: At program point L155-2(lines 139 157) the Hoare annotation is: (let ((.cse0 (= 2 ~m_st~0Int)) (.cse1 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp~1#1Int| 1))) (.cse6 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp~1#1Int| 0)) (.cse2 (= ~t1_pc~0Int 1)) (.cse3 (<= 2 ~E_1~0Int)) (.cse4 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_#res#1Int| 0)) (.cse5 (= ~t1_i~0Int 1)) (.cse7 (<= 2 ~T1_E~0Int)) (.cse8 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_~__retres1~1#1Int| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse3 (<= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_#res#1Int| 0) .cse5 .cse6 (= ~m_pc~0Int 0) (<= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_~__retres1~0#1Int| 0) .cse7) (let ((.cse9 (+ ~local~0Int 1))) (let ((.cse10 (+ ~token~0Int (* (div .cse9 4294967296) 4294967296)))) (and (<= .cse9 .cse10) .cse2 (= 0 ~m_st~0Int) .cse3 .cse4 .cse5 (< .cse10 (+ ~local~0Int 2)) .cse7 .cse8))))) [2022-01-11 00:17:00,927 INFO L858 garLoopResultBuilder]: For program point L292-3(lines 286 309) no Hoare annotation was computed. [2022-01-11 00:17:00,927 INFO L854 garLoopResultBuilder]: At program point L327-5(lines 311 335) the Hoare annotation is: (let ((.cse1 (= ~t1_pc~0Int 1)) (.cse9 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp___0~0#1Int| 0)) (.cse0 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp~1#1Int| 1))) (.cse2 (<= 2 ~E_M~0Int)) (.cse3 (<= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_#res#1Int| 0)) (.cse4 (= ~t1_i~0Int 1)) (.cse5 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp~1#1Int| 0)) (.cse10 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp___0~0#1Int| 1))) (.cse6 (<= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_~__retres1~0#1Int| 0)) (.cse7 (<= 2 ~T1_E~0Int)) (.cse8 (= 0 ~t1_st~0Int))) (or (and (= ~local~0Int ~token~0Int) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse9 .cse0 (<= 2 ~t1_st~0Int) .cse1 .cse2 .cse3 .cse4 .cse5 .cse10 .cse6 .cse7) (and (not .cse1) .cse9 .cse0 .cse2 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_#res#1Int| 0) .cse3 .cse4 .cse5 .cse10 .cse6 .cse7 .cse8 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_~__retres1~1#1Int| 0)))) [2022-01-11 00:17:00,927 INFO L858 garLoopResultBuilder]: For program point L327-6(lines 327 331) no Hoare annotation was computed. [2022-01-11 00:17:00,928 INFO L858 garLoopResultBuilder]: For program point L297-3(lines 286 309) no Hoare annotation was computed. [2022-01-11 00:17:00,928 INFO L854 garLoopResultBuilder]: At program point L344(lines 336 346) the Hoare annotation is: (let ((.cse1 (= ~t1_pc~0Int 1)) (.cse9 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp___0~0#1Int| 0)) (.cse0 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp~1#1Int| 1))) (.cse2 (<= 2 ~E_M~0Int)) (.cse3 (<= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_#res#1Int| 0)) (.cse4 (= ~t1_i~0Int 1)) (.cse5 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp~1#1Int| 0)) (.cse10 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp___0~0#1Int| 1))) (.cse6 (<= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_~__retres1~0#1Int| 0)) (.cse7 (<= 2 ~T1_E~0Int)) (.cse8 (= 0 ~t1_st~0Int))) (or (and (= ~local~0Int ~token~0Int) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse9 .cse0 (<= 2 ~t1_st~0Int) .cse1 .cse2 .cse3 .cse4 .cse5 .cse10 .cse6 .cse7) (and (not .cse1) .cse9 .cse0 .cse2 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_#res#1Int| 0) .cse3 .cse4 .cse5 .cse10 .cse6 .cse7 .cse8 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_~__retres1~1#1Int| 0)))) [2022-01-11 00:17:00,928 INFO L854 garLoopResultBuilder]: At program point L327-8(lines 311 335) the Hoare annotation is: (let ((.cse0 (= 2 ~m_st~0Int)) (.cse1 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp~1#1Int| 1))) (.cse5 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp~1#1Int| 0)) (.cse7 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp___0~0#1Int| 0)) (.cse2 (= ~t1_pc~0Int 1)) (.cse3 (<= 2 ~E_1~0Int)) (.cse8 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_#res#1Int| 0)) (.cse4 (= ~t1_i~0Int 1)) (.cse9 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp___0~0#1Int| 1))) (.cse6 (<= 2 ~T1_E~0Int)) (.cse10 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_~__retres1~1#1Int| 0))) (or (and .cse0 .cse1 .cse2 .cse3 (<= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_#res#1Int| 0) .cse4 .cse5 (= ~m_pc~0Int 0) (<= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_~__retres1~0#1Int| 0) .cse6) (and .cse7 .cse0 .cse1 .cse2 .cse3 .cse8 .cse4 .cse5 .cse9 .cse6 .cse10) (let ((.cse11 (+ ~local~0Int 1))) (let ((.cse12 (+ ~token~0Int (* (div .cse11 4294967296) 4294967296)))) (and (<= .cse11 .cse12) .cse7 .cse2 (= 0 ~m_st~0Int) .cse3 .cse8 .cse4 (< .cse12 (+ ~local~0Int 2)) .cse9 .cse6 .cse10))))) [2022-01-11 00:17:00,928 INFO L854 garLoopResultBuilder]: At program point L302-3(lines 283 310) the Hoare annotation is: (let ((.cse17 (= ~t1_pc~0Int 1))) (let ((.cse0 (not .cse17)) (.cse15 (= ~local~0Int ~token~0Int)) (.cse1 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp___0~0#1Int| 0)) (.cse16 (<= 2 ~t1_st~0Int)) (.cse19 (= 0 ~m_st~0Int)) (.cse6 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_#res#1Int| 0)) (.cse10 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp___0~0#1Int| 1))) (.cse14 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_~__retres1~1#1Int| 0)) (.cse2 (= 2 ~m_st~0Int)) (.cse3 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp~1#1Int| 1))) (.cse4 (<= 2 ~E_1~0Int)) (.cse5 (<= 2 ~E_M~0Int)) (.cse7 (<= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_#res#1Int| 0)) (.cse8 (= ~t1_i~0Int 1)) (.cse9 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp~1#1Int| 0)) (.cse18 (= ~m_pc~0Int 0)) (.cse11 (<= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_~__retres1~0#1Int| 0)) (.cse12 (<= 2 ~T1_E~0Int)) (.cse13 (= 0 ~t1_st~0Int))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse1 .cse2 .cse15 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse1 .cse2 .cse3 .cse16 .cse17 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14) (and .cse2 .cse3 .cse16 .cse17 .cse4 .cse5 .cse7 .cse8 .cse9 .cse18 .cse11 .cse12) (and .cse1 .cse15 .cse3 .cse16 .cse17 .cse19 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse18 .cse10 .cse11 .cse12 .cse14) (and .cse0 .cse1 .cse15 .cse3 .cse19 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse18 .cse10 .cse11 .cse12 .cse13 .cse14) (let ((.cse20 (+ ~local~0Int 1))) (let ((.cse21 (+ ~token~0Int (* (div .cse20 4294967296) 4294967296)))) (and (<= .cse20 .cse21) .cse1 .cse3 .cse16 .cse17 .cse19 .cse4 .cse5 .cse6 .cse7 .cse8 (< .cse21 (+ ~local~0Int 2)) .cse9 .cse10 .cse11 .cse12 .cse14))) (and .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse18 .cse11 .cse12 .cse13)))) [2022-01-11 00:17:00,928 INFO L854 garLoopResultBuilder]: At program point L344-1(lines 336 346) the Hoare annotation is: (let ((.cse0 (= 2 ~m_st~0Int)) (.cse1 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp~1#1Int| 1))) (.cse5 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp~1#1Int| 0)) (.cse7 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp___0~0#1Int| 0)) (.cse2 (= ~t1_pc~0Int 1)) (.cse3 (<= 2 ~E_1~0Int)) (.cse8 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_#res#1Int| 0)) (.cse4 (= ~t1_i~0Int 1)) (.cse9 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp___0~0#1Int| 1))) (.cse6 (<= 2 ~T1_E~0Int)) (.cse10 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_~__retres1~1#1Int| 0))) (or (and .cse0 .cse1 .cse2 .cse3 (<= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_#res#1Int| 0) .cse4 .cse5 (= ~m_pc~0Int 0) (<= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_~__retres1~0#1Int| 0) .cse6) (and .cse7 .cse0 .cse1 .cse2 .cse3 .cse8 .cse4 .cse5 .cse9 .cse6 .cse10) (let ((.cse11 (+ ~local~0Int 1))) (let ((.cse12 (+ ~token~0Int (* (div .cse11 4294967296) 4294967296)))) (and (<= .cse11 .cse12) .cse7 .cse2 (= 0 ~m_st~0Int) .cse3 .cse8 .cse4 (< .cse12 (+ ~local~0Int 2)) .cse9 .cse6 .cse10))))) [2022-01-11 00:17:00,928 INFO L858 garLoopResultBuilder]: For program point L188-1(lines 188 198) no Hoare annotation was computed. [2022-01-11 00:17:00,928 INFO L854 garLoopResultBuilder]: At program point L200-1(lines 187 202) the Hoare annotation is: (let ((.cse17 (= ~t1_pc~0Int 1))) (let ((.cse0 (not .cse17)) (.cse15 (= ~local~0Int ~token~0Int)) (.cse1 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp___0~0#1Int| 0)) (.cse16 (<= 2 ~t1_st~0Int)) (.cse19 (= 0 ~m_st~0Int)) (.cse6 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_#res#1Int| 0)) (.cse10 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp___0~0#1Int| 1))) (.cse14 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_~__retres1~1#1Int| 0)) (.cse2 (= 2 ~m_st~0Int)) (.cse3 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp~1#1Int| 1))) (.cse4 (<= 2 ~E_1~0Int)) (.cse5 (<= 2 ~E_M~0Int)) (.cse7 (<= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_#res#1Int| 0)) (.cse8 (= ~t1_i~0Int 1)) (.cse9 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp~1#1Int| 0)) (.cse18 (= ~m_pc~0Int 0)) (.cse11 (<= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_~__retres1~0#1Int| 0)) (.cse12 (<= 2 ~T1_E~0Int)) (.cse13 (= 0 ~t1_st~0Int))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse1 .cse2 .cse15 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse1 .cse2 .cse3 .cse16 .cse17 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14) (and .cse2 .cse3 .cse16 .cse17 .cse4 .cse5 .cse7 .cse8 .cse9 .cse18 .cse11 .cse12) (and .cse1 .cse15 .cse3 .cse16 .cse17 .cse19 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse18 .cse10 .cse11 .cse12 .cse14) (and .cse0 .cse1 .cse15 .cse3 .cse19 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse18 .cse10 .cse11 .cse12 .cse13 .cse14) (let ((.cse20 (+ ~local~0Int 1))) (let ((.cse21 (+ ~token~0Int (* (div .cse20 4294967296) 4294967296)))) (and (<= .cse20 .cse21) .cse1 .cse3 .cse16 .cse17 .cse19 .cse4 .cse5 .cse6 .cse7 .cse8 (< .cse21 (+ ~local~0Int 2)) .cse9 .cse10 .cse11 .cse12 .cse14))) (and .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse18 .cse11 .cse12 .cse13)))) [2022-01-11 00:17:00,928 INFO L858 garLoopResultBuilder]: For program point L192-1(lines 192 197) no Hoare annotation was computed. [2022-01-11 00:17:00,929 INFO L854 garLoopResultBuilder]: At program point L201-1(lines 184 203) the Hoare annotation is: (let ((.cse17 (= ~t1_pc~0Int 1))) (let ((.cse0 (not .cse17)) (.cse15 (= ~local~0Int ~token~0Int)) (.cse1 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp___0~0#1Int| 0)) (.cse16 (<= 2 ~t1_st~0Int)) (.cse19 (= 0 ~m_st~0Int)) (.cse6 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_#res#1Int| 0)) (.cse10 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp___0~0#1Int| 1))) (.cse14 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_~__retres1~1#1Int| 0)) (.cse2 (= 2 ~m_st~0Int)) (.cse3 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp~1#1Int| 1))) (.cse4 (<= 2 ~E_1~0Int)) (.cse5 (<= 2 ~E_M~0Int)) (.cse7 (<= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_#res#1Int| 0)) (.cse8 (= ~t1_i~0Int 1)) (.cse9 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp~1#1Int| 0)) (.cse18 (= ~m_pc~0Int 0)) (.cse11 (<= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_~__retres1~0#1Int| 0)) (.cse12 (<= 2 ~T1_E~0Int)) (.cse13 (= 0 ~t1_st~0Int))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse1 .cse2 .cse15 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse1 .cse2 .cse3 .cse16 .cse17 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14) (and .cse2 .cse3 .cse16 .cse17 .cse4 .cse5 .cse7 .cse8 .cse9 .cse18 .cse11 .cse12) (and .cse1 .cse15 .cse3 .cse16 .cse17 .cse19 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse18 .cse10 .cse11 .cse12 .cse14) (and .cse0 .cse1 .cse15 .cse3 .cse19 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse18 .cse10 .cse11 .cse12 .cse13 .cse14) (let ((.cse20 (+ ~local~0Int 1))) (let ((.cse21 (+ ~token~0Int (* (div .cse20 4294967296) 4294967296)))) (and (<= .cse20 .cse21) .cse1 .cse3 .cse16 .cse17 .cse19 .cse4 .cse5 .cse6 .cse7 .cse8 (< .cse21 (+ ~local~0Int 2)) .cse9 .cse10 .cse11 .cse12 .cse14))) (and .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse18 .cse11 .cse12 .cse13)))) [2022-01-11 00:17:00,929 INFO L858 garLoopResultBuilder]: For program point L447(lines 447 456) no Hoare annotation was computed. [2022-01-11 00:17:00,929 INFO L854 garLoopResultBuilder]: At program point L353(lines 347 355) the Hoare annotation is: (let ((.cse17 (= ~t1_pc~0Int 1))) (let ((.cse0 (not .cse17)) (.cse15 (= ~local~0Int ~token~0Int)) (.cse1 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp___0~0#1Int| 0)) (.cse16 (<= 2 ~t1_st~0Int)) (.cse19 (= 0 ~m_st~0Int)) (.cse6 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_#res#1Int| 0)) (.cse10 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp___0~0#1Int| 1))) (.cse14 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_~__retres1~1#1Int| 0)) (.cse2 (= 2 ~m_st~0Int)) (.cse3 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp~1#1Int| 1))) (.cse4 (<= 2 ~E_1~0Int)) (.cse5 (<= 2 ~E_M~0Int)) (.cse7 (<= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_#res#1Int| 0)) (.cse8 (= ~t1_i~0Int 1)) (.cse9 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp~1#1Int| 0)) (.cse18 (= ~m_pc~0Int 0)) (.cse11 (<= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_~__retres1~0#1Int| 0)) (.cse12 (<= 2 ~T1_E~0Int)) (.cse13 (= 0 ~t1_st~0Int))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse1 .cse2 .cse15 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse1 .cse2 .cse3 .cse16 .cse17 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14) (and .cse2 .cse3 .cse16 .cse17 .cse4 .cse5 .cse7 .cse8 .cse9 .cse18 .cse11 .cse12) (and .cse1 .cse15 .cse3 .cse16 .cse17 .cse19 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse18 .cse10 .cse11 .cse12 .cse14) (and .cse0 .cse1 .cse15 .cse3 .cse19 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse18 .cse10 .cse11 .cse12 .cse13 .cse14) (let ((.cse20 (+ ~local~0Int 1))) (let ((.cse21 (+ ~token~0Int (* (div .cse20 4294967296) 4294967296)))) (and (<= .cse20 .cse21) .cse1 .cse3 .cse16 .cse17 .cse19 .cse4 .cse5 .cse6 .cse7 .cse8 (< .cse21 (+ ~local~0Int 2)) .cse9 .cse10 .cse11 .cse12 .cse14))) (and .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse18 .cse11 .cse12 .cse13)))) [2022-01-11 00:17:00,929 INFO L858 garLoopResultBuilder]: For program point L447-2(lines 447 456) no Hoare annotation was computed. [2022-01-11 00:17:00,929 INFO L858 garLoopResultBuilder]: For program point L124-12(lines 124 133) no Hoare annotation was computed. [2022-01-11 00:17:00,930 INFO L858 garLoopResultBuilder]: For program point L188-2(lines 188 198) no Hoare annotation was computed. [2022-01-11 00:17:00,930 INFO L858 garLoopResultBuilder]: For program point L125-4(lines 125 130) no Hoare annotation was computed. [2022-01-11 00:17:00,930 INFO L858 garLoopResultBuilder]: For program point L124-14(lines 124 133) no Hoare annotation was computed. [2022-01-11 00:17:00,930 INFO L854 garLoopResultBuilder]: At program point L200-2(lines 187 202) the Hoare annotation is: (let ((.cse17 (= ~t1_pc~0Int 1))) (let ((.cse0 (not .cse17)) (.cse15 (= ~local~0Int ~token~0Int)) (.cse1 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp___0~0#1Int| 0)) (.cse16 (<= 2 ~t1_st~0Int)) (.cse19 (= 0 ~m_st~0Int)) (.cse6 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_#res#1Int| 0)) (.cse10 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp___0~0#1Int| 1))) (.cse14 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_~__retres1~1#1Int| 0)) (.cse2 (= 2 ~m_st~0Int)) (.cse3 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp~1#1Int| 1))) (.cse4 (<= 2 ~E_1~0Int)) (.cse5 (<= 2 ~E_M~0Int)) (.cse7 (<= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_#res#1Int| 0)) (.cse8 (= ~t1_i~0Int 1)) (.cse9 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp~1#1Int| 0)) (.cse18 (= ~m_pc~0Int 0)) (.cse11 (<= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_~__retres1~0#1Int| 0)) (.cse12 (<= 2 ~T1_E~0Int)) (.cse13 (= 0 ~t1_st~0Int))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse1 .cse2 .cse15 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse1 .cse2 .cse3 .cse16 .cse17 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14) (and .cse2 .cse3 .cse16 .cse17 .cse4 .cse5 .cse7 .cse8 .cse9 .cse18 .cse11 .cse12) (and .cse1 .cse15 .cse3 .cse16 .cse17 .cse19 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse18 .cse10 .cse11 .cse12 .cse14) (and .cse0 .cse1 .cse15 .cse3 .cse19 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse18 .cse10 .cse11 .cse12 .cse13 .cse14) (let ((.cse20 (+ ~local~0Int 1))) (let ((.cse21 (+ ~token~0Int (* (div .cse20 4294967296) 4294967296)))) (and (<= .cse20 .cse21) .cse1 .cse3 .cse16 .cse17 .cse19 .cse4 .cse5 .cse6 .cse7 .cse8 (< .cse21 (+ ~local~0Int 2)) .cse9 .cse10 .cse11 .cse12 .cse14))) (and .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse18 .cse11 .cse12 .cse13)))) [2022-01-11 00:17:00,930 INFO L858 garLoopResultBuilder]: For program point L192-2(lines 192 197) no Hoare annotation was computed. [2022-01-11 00:17:00,930 INFO L854 garLoopResultBuilder]: At program point L135-4(lines 123 137) the Hoare annotation is: (let ((.cse2 (= ~t1_pc~0Int 1))) (let ((.cse14 (not .cse2)) (.cse0 (= ~local~0Int ~token~0Int)) (.cse13 (= 0 ~t1_st~0Int)) (.cse8 (= ~m_pc~0Int 0)) (.cse3 (= 0 ~m_st~0Int)) (.cse12 (= 2 ~m_st~0Int)) (.cse1 (<= 2 ~t1_st~0Int)) (.cse4 (<= 2 ~E_1~0Int)) (.cse5 (<= 2 ~E_M~0Int)) (.cse6 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_#res#1Int| 0)) (.cse7 (= ~t1_i~0Int 1)) (.cse9 (<= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_~__retres1~0#1Int| 0)) (.cse10 (<= 2 ~T1_E~0Int)) (.cse11 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_~__retres1~1#1Int| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse12 .cse0 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse13 .cse11) (and .cse12 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse13) (and .cse14 .cse12 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse13 .cse11) (and .cse14 .cse0 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse13 .cse11) (and .cse12 .cse1 .cse2 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10) (let ((.cse15 (+ ~local~0Int 1))) (let ((.cse16 (+ ~token~0Int (* (div .cse15 4294967296) 4294967296)))) (and (<= .cse15 .cse16) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse16 (+ ~local~0Int 2)) .cse9 .cse10 .cse11))) (and .cse12 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11)))) [2022-01-11 00:17:00,930 INFO L854 garLoopResultBuilder]: At program point L201-2(lines 184 203) the Hoare annotation is: (let ((.cse17 (= ~t1_pc~0Int 1))) (let ((.cse0 (not .cse17)) (.cse15 (= ~local~0Int ~token~0Int)) (.cse1 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp___0~0#1Int| 0)) (.cse16 (<= 2 ~t1_st~0Int)) (.cse19 (= 0 ~m_st~0Int)) (.cse6 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_#res#1Int| 0)) (.cse10 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp___0~0#1Int| 1))) (.cse14 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_~__retres1~1#1Int| 0)) (.cse2 (= 2 ~m_st~0Int)) (.cse3 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp~1#1Int| 1))) (.cse4 (<= 2 ~E_1~0Int)) (.cse5 (<= 2 ~E_M~0Int)) (.cse7 (<= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_#res#1Int| 0)) (.cse8 (= ~t1_i~0Int 1)) (.cse9 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp~1#1Int| 0)) (.cse18 (= ~m_pc~0Int 0)) (.cse11 (<= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_~__retres1~0#1Int| 0)) (.cse12 (<= 2 ~T1_E~0Int)) (.cse13 (= 0 ~t1_st~0Int))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse1 .cse2 .cse15 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse1 .cse2 .cse3 .cse16 .cse17 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14) (and .cse2 .cse3 .cse16 .cse17 .cse4 .cse5 .cse7 .cse8 .cse9 .cse18 .cse11 .cse12) (and .cse1 .cse15 .cse3 .cse16 .cse17 .cse19 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse18 .cse10 .cse11 .cse12 .cse14) (and .cse0 .cse1 .cse15 .cse3 .cse19 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse18 .cse10 .cse11 .cse12 .cse13 .cse14) (let ((.cse20 (+ ~local~0Int 1))) (let ((.cse21 (+ ~token~0Int (* (div .cse20 4294967296) 4294967296)))) (and (<= .cse20 .cse21) .cse1 .cse3 .cse16 .cse17 .cse19 .cse4 .cse5 .cse6 .cse7 .cse8 (< .cse21 (+ ~local~0Int 2)) .cse9 .cse10 .cse11 .cse12 .cse14))) (and .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse18 .cse11 .cse12 .cse13)))) [2022-01-11 00:17:00,931 INFO L854 garLoopResultBuilder]: At program point L136-4(lines 120 138) the Hoare annotation is: (let ((.cse15 (= ~t1_pc~0Int 1))) (let ((.cse0 (not .cse15)) (.cse9 (= 0 ~t1_st~0Int)) (.cse12 (= ~local~0Int ~token~0Int)) (.cse11 (= ~m_pc~0Int 0)) (.cse1 (= 2 ~m_st~0Int)) (.cse14 (<= 2 ~t1_st~0Int)) (.cse13 (= 0 ~m_st~0Int)) (.cse2 (<= 2 ~E_1~0Int)) (.cse3 (<= 2 ~E_M~0Int)) (.cse4 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_#res#1Int| 0)) (.cse5 (<= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_#res#1Int| 0)) (.cse6 (= ~t1_i~0Int 1)) (.cse7 (<= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_~__retres1~0#1Int| 0)) (.cse8 (<= 2 ~T1_E~0Int)) (.cse10 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_~__retres1~1#1Int| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse1 .cse2 .cse3 .cse5 .cse6 .cse11 .cse7 .cse8 .cse9) (and .cse0 .cse12 .cse13 .cse2 .cse3 .cse4 .cse5 .cse6 .cse11 .cse7 .cse8 .cse9 .cse10) (and .cse1 .cse12 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse12 .cse14 .cse15 .cse13 .cse2 .cse3 .cse4 .cse5 .cse6 .cse11 .cse7 .cse8 .cse10) (and .cse1 .cse14 .cse15 .cse2 .cse3 .cse5 .cse6 .cse11 .cse7 .cse8) (and .cse1 .cse14 .cse15 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10) (let ((.cse16 (+ ~local~0Int 1))) (let ((.cse17 (+ ~token~0Int (* (div .cse16 4294967296) 4294967296)))) (and (<= .cse16 .cse17) .cse14 .cse15 .cse13 .cse2 .cse3 .cse4 .cse5 .cse6 (< .cse17 (+ ~local~0Int 2)) .cse7 .cse8 .cse10)))))) [2022-01-11 00:17:00,931 INFO L858 garLoopResultBuilder]: For program point L402(lines 402 407) no Hoare annotation was computed. [2022-01-11 00:17:00,931 INFO L858 garLoopResultBuilder]: For program point L319-12(lines 319 323) no Hoare annotation was computed. [2022-01-11 00:17:00,931 INFO L854 garLoopResultBuilder]: At program point L409(lines 398 411) the Hoare annotation is: (let ((.cse17 (= ~t1_pc~0Int 1))) (let ((.cse0 (not .cse17)) (.cse15 (= ~local~0Int ~token~0Int)) (.cse1 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp___0~0#1Int| 0)) (.cse16 (<= 2 ~t1_st~0Int)) (.cse19 (= 0 ~m_st~0Int)) (.cse6 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_#res#1Int| 0)) (.cse10 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp___0~0#1Int| 1))) (.cse14 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_~__retres1~1#1Int| 0)) (.cse2 (= 2 ~m_st~0Int)) (.cse3 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp~1#1Int| 1))) (.cse4 (<= 2 ~E_1~0Int)) (.cse5 (<= 2 ~E_M~0Int)) (.cse7 (<= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_#res#1Int| 0)) (.cse8 (= ~t1_i~0Int 1)) (.cse9 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp~1#1Int| 0)) (.cse18 (= ~m_pc~0Int 0)) (.cse11 (<= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_~__retres1~0#1Int| 0)) (.cse12 (<= 2 ~T1_E~0Int)) (.cse13 (= 0 ~t1_st~0Int))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse1 .cse2 .cse15 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse1 .cse2 .cse3 .cse16 .cse17 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14) (and .cse2 .cse3 .cse16 .cse17 .cse4 .cse5 .cse7 .cse8 .cse9 .cse18 .cse11 .cse12) (and .cse1 .cse15 .cse3 .cse16 .cse17 .cse19 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse18 .cse10 .cse11 .cse12 .cse14) (and .cse0 .cse1 .cse15 .cse3 .cse19 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse18 .cse10 .cse11 .cse12 .cse13 .cse14) (let ((.cse20 (+ ~local~0Int 1))) (let ((.cse21 (+ ~token~0Int (* (div .cse20 4294967296) 4294967296)))) (and (<= .cse20 .cse21) .cse1 .cse3 .cse16 .cse17 .cse19 .cse4 .cse5 .cse6 .cse7 .cse8 (< .cse21 (+ ~local~0Int 2)) .cse9 .cse10 .cse11 .cse12 .cse14))) (and .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse18 .cse11 .cse12 .cse13)))) [2022-01-11 00:17:00,931 INFO L858 garLoopResultBuilder]: For program point L319-14(lines 319 323) no Hoare annotation was computed. [2022-01-11 00:17:00,931 INFO L854 garLoopResultBuilder]: At program point L410(lines 394 412) the Hoare annotation is: (let ((.cse17 (= ~t1_pc~0Int 1))) (let ((.cse0 (not .cse17)) (.cse15 (= ~local~0Int ~token~0Int)) (.cse1 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp___0~0#1Int| 0)) (.cse16 (<= 2 ~t1_st~0Int)) (.cse19 (= 0 ~m_st~0Int)) (.cse6 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_#res#1Int| 0)) (.cse10 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp___0~0#1Int| 1))) (.cse14 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_~__retres1~1#1Int| 0)) (.cse2 (= 2 ~m_st~0Int)) (.cse3 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp~1#1Int| 1))) (.cse4 (<= 2 ~E_1~0Int)) (.cse5 (<= 2 ~E_M~0Int)) (.cse7 (<= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_#res#1Int| 0)) (.cse8 (= ~t1_i~0Int 1)) (.cse9 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp~1#1Int| 0)) (.cse18 (= ~m_pc~0Int 0)) (.cse11 (<= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_~__retres1~0#1Int| 0)) (.cse12 (<= 2 ~T1_E~0Int)) (.cse13 (= 0 ~t1_st~0Int))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse1 .cse2 .cse15 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse1 .cse2 .cse3 .cse16 .cse17 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14) (and .cse2 .cse3 .cse16 .cse17 .cse4 .cse5 .cse7 .cse8 .cse9 .cse18 .cse11 .cse12) (and .cse1 .cse15 .cse3 .cse16 .cse17 .cse19 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse18 .cse10 .cse11 .cse12 .cse14) (and .cse0 .cse1 .cse15 .cse3 .cse19 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse18 .cse10 .cse11 .cse12 .cse13 .cse14) (let ((.cse20 (+ ~local~0Int 1))) (let ((.cse21 (+ ~token~0Int (* (div .cse20 4294967296) 4294967296)))) (and (<= .cse20 .cse21) .cse1 .cse3 .cse16 .cse17 .cse19 .cse4 .cse5 .cse6 .cse7 .cse8 (< .cse21 (+ ~local~0Int 2)) .cse9 .cse10 .cse11 .cse12 .cse14))) (and .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse18 .cse11 .cse12 .cse13)))) [2022-01-11 00:17:00,931 INFO L858 garLoopResultBuilder]: For program point L143-12(lines 143 152) no Hoare annotation was computed. [2022-01-11 00:17:00,931 INFO L858 garLoopResultBuilder]: For program point L460(lines 460 464) no Hoare annotation was computed. [2022-01-11 00:17:00,931 INFO L858 garLoopResultBuilder]: For program point L144-4(lines 144 149) no Hoare annotation was computed. [2022-01-11 00:17:00,932 INFO L858 garLoopResultBuilder]: For program point L143-14(lines 143 152) no Hoare annotation was computed. [2022-01-11 00:17:00,932 INFO L854 garLoopResultBuilder]: At program point L154-4(lines 142 156) the Hoare annotation is: (let ((.cse14 (= ~t1_pc~0Int 1))) (let ((.cse0 (not .cse14)) (.cse12 (= ~local~0Int ~token~0Int)) (.cse13 (<= 2 ~t1_st~0Int)) (.cse18 (= 0 ~m_st~0Int)) (.cse11 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_~__retres1~1#1Int| 0)) (.cse1 (= 2 ~m_st~0Int)) (.cse2 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp~1#1Int| 1))) (.cse3 (<= 2 ~E_1~0Int)) (.cse4 (<= 2 ~E_M~0Int)) (.cse5 (<= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_#res#1Int| 0)) (.cse6 (= ~t1_i~0Int 1)) (.cse7 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp~1#1Int| 0)) (.cse15 (= ~m_pc~0Int 0)) (.cse8 (<= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_~__retres1~0#1Int| 0)) (.cse9 (<= 2 ~T1_E~0Int)) (.cse10 (= 0 ~t1_st~0Int))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse1 .cse12 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse1 .cse2 .cse13 .cse14 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11) (and .cse1 .cse2 .cse13 .cse14 .cse3 .cse4 .cse5 .cse6 .cse7 .cse15 .cse8 .cse9) (let ((.cse16 (+ ~local~0Int 1))) (let ((.cse17 (+ ~token~0Int (* (div .cse16 4294967296) 4294967296)))) (and (<= .cse16 .cse17) .cse2 .cse13 .cse14 .cse18 .cse3 .cse4 .cse5 .cse6 (< .cse17 (+ ~local~0Int 2)) .cse7 .cse8 .cse9 .cse11))) (and .cse0 .cse12 .cse2 .cse18 .cse3 .cse4 .cse5 .cse6 .cse7 .cse15 .cse8 .cse9 .cse10 .cse11) (and .cse12 .cse2 .cse13 .cse14 .cse18 .cse3 .cse4 .cse5 .cse6 .cse7 .cse15 .cse8 .cse9 .cse11) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse15 .cse8 .cse9 .cse10)))) [2022-01-11 00:17:00,932 INFO L854 garLoopResultBuilder]: At program point L155-4(lines 139 157) the Hoare annotation is: (let ((.cse17 (= ~t1_pc~0Int 1))) (let ((.cse1 (= ~local~0Int ~token~0Int)) (.cse0 (not .cse17)) (.cse15 (= 2 ~m_st~0Int)) (.cse10 (= ~m_pc~0Int 0)) (.cse13 (= 0 ~t1_st~0Int)) (.cse2 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp~1#1Int| 1))) (.cse16 (<= 2 ~t1_st~0Int)) (.cse3 (= 0 ~m_st~0Int)) (.cse4 (<= 2 ~E_1~0Int)) (.cse5 (<= 2 ~E_M~0Int)) (.cse6 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_#res#1Int| 0)) (.cse7 (<= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_#res#1Int| 0)) (.cse8 (= ~t1_i~0Int 1)) (.cse9 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp~1#1Int| 0)) (.cse11 (<= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_~__retres1~0#1Int| 0)) (.cse12 (<= 2 ~T1_E~0Int)) (.cse14 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_~__retres1~1#1Int| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse15 .cse2 .cse16 .cse17 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse15 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14) (and .cse15 .cse2 .cse16 .cse17 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse14) (and .cse1 .cse2 .cse16 .cse17 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14) (and .cse0 .cse15 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14) (and .cse15 .cse2 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (let ((.cse18 (+ ~local~0Int 1))) (let ((.cse19 (+ ~token~0Int (* (div .cse18 4294967296) 4294967296)))) (and (<= .cse18 .cse19) .cse2 .cse16 .cse17 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (< .cse19 (+ ~local~0Int 2)) .cse9 .cse11 .cse12 .cse14)))))) [2022-01-11 00:17:00,932 INFO L858 garLoopResultBuilder]: For program point L327-12(lines 327 331) no Hoare annotation was computed. [2022-01-11 00:17:00,932 INFO L854 garLoopResultBuilder]: At program point L327-14(lines 311 335) the Hoare annotation is: (let ((.cse17 (= ~t1_pc~0Int 1))) (let ((.cse0 (not .cse17)) (.cse15 (= ~local~0Int ~token~0Int)) (.cse1 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp___0~0#1Int| 0)) (.cse16 (<= 2 ~t1_st~0Int)) (.cse19 (= 0 ~m_st~0Int)) (.cse6 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_#res#1Int| 0)) (.cse10 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp___0~0#1Int| 1))) (.cse14 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_~__retres1~1#1Int| 0)) (.cse2 (= 2 ~m_st~0Int)) (.cse3 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp~1#1Int| 1))) (.cse4 (<= 2 ~E_1~0Int)) (.cse5 (<= 2 ~E_M~0Int)) (.cse7 (<= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_#res#1Int| 0)) (.cse8 (= ~t1_i~0Int 1)) (.cse9 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp~1#1Int| 0)) (.cse18 (= ~m_pc~0Int 0)) (.cse11 (<= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_~__retres1~0#1Int| 0)) (.cse12 (<= 2 ~T1_E~0Int)) (.cse13 (= 0 ~t1_st~0Int))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse1 .cse2 .cse15 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse1 .cse2 .cse3 .cse16 .cse17 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14) (and .cse2 .cse3 .cse16 .cse17 .cse4 .cse5 .cse7 .cse8 .cse9 .cse18 .cse11 .cse12) (and .cse1 .cse15 .cse3 .cse16 .cse17 .cse19 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse18 .cse10 .cse11 .cse12 .cse14) (and .cse0 .cse1 .cse15 .cse3 .cse19 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse18 .cse10 .cse11 .cse12 .cse13 .cse14) (let ((.cse20 (+ ~local~0Int 1))) (let ((.cse21 (+ ~token~0Int (* (div .cse20 4294967296) 4294967296)))) (and (<= .cse20 .cse21) .cse1 .cse3 .cse16 .cse17 .cse19 .cse4 .cse5 .cse6 .cse7 .cse8 (< .cse21 (+ ~local~0Int 2)) .cse9 .cse10 .cse11 .cse12 .cse14))) (and .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse18 .cse11 .cse12 .cse13)))) [2022-01-11 00:17:00,932 INFO L858 garLoopResultBuilder]: For program point L360(lines 360 364) no Hoare annotation was computed. [2022-01-11 00:17:00,932 INFO L858 garLoopResultBuilder]: For program point L360-2(lines 359 382) no Hoare annotation was computed. [2022-01-11 00:17:00,932 INFO L858 garLoopResultBuilder]: For program point L365-1(lines 359 382) no Hoare annotation was computed. [2022-01-11 00:17:00,932 INFO L858 garLoopResultBuilder]: For program point L370-1(lines 359 382) no Hoare annotation was computed. [2022-01-11 00:17:00,933 INFO L854 garLoopResultBuilder]: At program point L375-1(lines 356 383) the Hoare annotation is: (let ((.cse17 (= ~t1_pc~0Int 1))) (let ((.cse0 (not .cse17)) (.cse15 (= ~local~0Int ~token~0Int)) (.cse1 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp___0~0#1Int| 0)) (.cse16 (<= 2 ~t1_st~0Int)) (.cse19 (= 0 ~m_st~0Int)) (.cse6 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_#res#1Int| 0)) (.cse10 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp___0~0#1Int| 1))) (.cse14 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_~__retres1~1#1Int| 0)) (.cse2 (= 2 ~m_st~0Int)) (.cse3 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp~1#1Int| 1))) (.cse4 (<= 2 ~E_1~0Int)) (.cse5 (<= 2 ~E_M~0Int)) (.cse7 (<= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_#res#1Int| 0)) (.cse8 (= ~t1_i~0Int 1)) (.cse9 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp~1#1Int| 0)) (.cse18 (= ~m_pc~0Int 0)) (.cse11 (<= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_~__retres1~0#1Int| 0)) (.cse12 (<= 2 ~T1_E~0Int)) (.cse13 (= 0 ~t1_st~0Int))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse1 .cse2 .cse15 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse1 .cse2 .cse3 .cse16 .cse17 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14) (and .cse2 .cse3 .cse16 .cse17 .cse4 .cse5 .cse7 .cse8 .cse9 .cse18 .cse11 .cse12) (and .cse1 .cse15 .cse3 .cse16 .cse17 .cse19 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse18 .cse10 .cse11 .cse12 .cse14) (and .cse0 .cse1 .cse15 .cse3 .cse19 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse18 .cse10 .cse11 .cse12 .cse13 .cse14) (let ((.cse20 (+ ~local~0Int 1))) (let ((.cse21 (+ ~token~0Int (* (div .cse20 4294967296) 4294967296)))) (and (<= .cse20 .cse21) .cse1 .cse3 .cse16 .cse17 .cse19 .cse4 .cse5 .cse6 .cse7 .cse8 (< .cse21 (+ ~local~0Int 2)) .cse9 .cse10 .cse11 .cse12 .cse14))) (and .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse18 .cse11 .cse12 .cse13)))) [2022-01-11 00:17:00,937 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 00:17:00,938 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-11 00:17:01,132 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.01 12:17:01 BasicIcfg [2022-01-11 00:17:01,132 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-11 00:17:01,133 INFO L158 Benchmark]: Toolchain (without parser) took 17224.87ms. Allocated memory was 188.7MB in the beginning and 326.1MB in the end (delta: 137.4MB). Free memory was 139.1MB in the beginning and 289.6MB in the end (delta: -150.5MB). Peak memory consumption was 175.3MB. Max. memory is 8.0GB. [2022-01-11 00:17:01,133 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 188.7MB. Free memory is still 155.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-11 00:17:01,133 INFO L158 Benchmark]: CACSL2BoogieTranslator took 256.85ms. Allocated memory is still 188.7MB. Free memory was 139.0MB in the beginning and 158.3MB in the end (delta: -19.3MB). Peak memory consumption was 14.0MB. Max. memory is 8.0GB. [2022-01-11 00:17:01,134 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.27ms. Allocated memory is still 188.7MB. Free memory was 158.3MB in the beginning and 155.8MB in the end (delta: 2.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-01-11 00:17:01,134 INFO L158 Benchmark]: Boogie Preprocessor took 49.89ms. Allocated memory is still 188.7MB. Free memory was 155.8MB in the beginning and 153.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-01-11 00:17:01,134 INFO L158 Benchmark]: RCFGBuilder took 541.25ms. Allocated memory is still 188.7MB. Free memory was 153.7MB in the beginning and 134.4MB in the end (delta: 19.3MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2022-01-11 00:17:01,134 INFO L158 Benchmark]: IcfgTransformer took 165.66ms. Allocated memory is still 188.7MB. Free memory was 134.4MB in the beginning and 126.0MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2022-01-11 00:17:01,135 INFO L158 Benchmark]: TraceAbstraction took 16140.78ms. Allocated memory was 188.7MB in the beginning and 326.1MB in the end (delta: 137.4MB). Free memory was 125.4MB in the beginning and 289.6MB in the end (delta: -164.2MB). Peak memory consumption was 162.4MB. Max. memory is 8.0GB. [2022-01-11 00:17:01,136 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.12ms. Allocated memory is still 188.7MB. Free memory is still 155.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 256.85ms. Allocated memory is still 188.7MB. Free memory was 139.0MB in the beginning and 158.3MB in the end (delta: -19.3MB). Peak memory consumption was 14.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 64.27ms. Allocated memory is still 188.7MB. Free memory was 158.3MB in the beginning and 155.8MB in the end (delta: 2.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 49.89ms. Allocated memory is still 188.7MB. Free memory was 155.8MB in the beginning and 153.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 541.25ms. Allocated memory is still 188.7MB. Free memory was 153.7MB in the beginning and 134.4MB in the end (delta: 19.3MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * IcfgTransformer took 165.66ms. Allocated memory is still 188.7MB. Free memory was 134.4MB in the beginning and 126.0MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * TraceAbstraction took 16140.78ms. Allocated memory was 188.7MB in the beginning and 326.1MB in the end (delta: 137.4MB). Free memory was 125.4MB in the beginning and 289.6MB in the end (delta: -164.2MB). Peak memory consumption was 162.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 20]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 153 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 15.9s, OverallIterations: 15, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 11.9s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2838 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2838 mSDsluCounter, 5348 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2099 mSDsCounter, 119 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 244 IncrementalHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 119 mSolverCounterUnsat, 3249 mSDtfsCounter, 244 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 52 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2431occurred in iteration=9, InterpolantAutomatonStates: 52, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 15 MinimizatonAttempts, 434 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 57 LocationsWithAnnotation, 57 PreInvPairs, 621 NumberOfFragments, 12607 HoareAnnotationTreeSize, 57 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.5s HoareSimplificationTime, 57 FomulaSimplificationsInter, 25657 FormulaSimplificationTreeSizeReductionInter, 11.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 1112 NumberOfCodeBlocks, 1112 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 1097 ConstructedInterpolants, 0 QuantifiedInterpolants, 2441 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 218/218 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 142]: Loop Invariant Derived loop invariant: (((((((((((((((((((~bvule32(2bv32, E_M) && ~bvule32(__retres1, 0bv32)) && ~bvule32(\result, 0bv32)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && local == token) && 1bv32 == t1_i) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) || (((((((((((~bvule32(2bv32, E_M) && ~bvule32(__retres1, 0bv32)) && ~bvule32(\result, 0bv32)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && 2bv32 == m_st) && 1bv32 == t1_i) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || (((((((((((~bvule32(2bv32, E_M) && ~bvule32(__retres1, 0bv32)) && ~bvule32(\result, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && 2bv32 == m_st) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || (((((((((((~bvule32(2bv32, E_M) && ~bvule32(__retres1, 0bv32)) && ~bvule32(\result, 0bv32)) && t1_st == 0bv32) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && 2bv32 == m_st) && local == token) && 1bv32 == t1_i) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || (((((((((((~bvule32(2bv32, E_M) && ~bvule32(__retres1, 0bv32)) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && 2bv32 == m_st) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || ((((((((((~bvule32(2bv32, E_M) && ~bvule32(__retres1, 0bv32)) && ~bvule32(\result, 0bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && 2bv32 == m_st) && 1bv32 == t1_i) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || (((((((((((((~bvule32(2bv32, E_M) && ~bvule32(__retres1, 0bv32)) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && local == token) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || (((((((((((((~bvule32(2bv32, E_M) && ~bvule32(__retres1, 0bv32)) && ~bvule34(~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)), ~bvadd16(~zero_extendFrom32To34(token), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)[32:32] ++ 0bv32)))) && ~bvule32(\result, 0bv32)) && ~bvult64(~bvadd16(~zero_extendFrom32To34(token), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)[32:32] ++ 0bv32)), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 2bv33)))) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) - InvariantResult [Line: 210]: Loop Invariant Derived loop invariant: ((((((((((((((((((((~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33)) && ~bvule32(2bv32, E_M)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(\result, 0bv32)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && 2bv32 == m_st) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) || ((((((((((((((((~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33)) && ~bvule32(2bv32, E_M)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(\result, 0bv32)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && local == token) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || (((((((((((~bvule32(2bv32, E_M) && ~bvule32(__retres1, 0bv32)) && ~bvule32(\result, 0bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && 2bv32 == m_st) && local == token) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || ((((((((((~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33)) && ~bvule32(2bv32, E_M)) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && 2bv32 == m_st) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || (((((((((((~bvule32(2bv32, E_M) && ~bvule32(__retres1, 0bv32)) && ~bvule32(\result, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && 2bv32 == m_st) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || ((((((((((~bvule32(2bv32, E_M) && ~bvule32(__retres1, 0bv32)) && ~bvule32(\result, 0bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && 2bv32 == m_st) && 1bv32 == t1_i) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || ((((((((((((((((~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33)) && ~bvule32(2bv32, E_M)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(\result, 0bv32)) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && local == token) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || ((((((((((((~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33)) && ~bvule32(2bv32, E_M)) && ~bvule34(~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)), ~bvadd16(~zero_extendFrom32To34(token), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)[32:32] ++ 0bv32)))) && ~bvult64(~bvadd16(~zero_extendFrom32To34(token), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)[32:32] ++ 0bv32)), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 2bv33)))) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) - InvariantResult [Line: 204]: Loop Invariant Derived loop invariant: ((((((((((((((((((((~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33)) && ~bvule32(2bv32, E_M)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(\result, 0bv32)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && 2bv32 == m_st) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) || ((((((((((((((((~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33)) && ~bvule32(2bv32, E_M)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(\result, 0bv32)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && local == token) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || (((((((((((~bvule32(2bv32, E_M) && ~bvule32(__retres1, 0bv32)) && ~bvule32(\result, 0bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && 2bv32 == m_st) && local == token) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || ((((((((((~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33)) && ~bvule32(2bv32, E_M)) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && 2bv32 == m_st) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || (((((((((((~bvule32(2bv32, E_M) && ~bvule32(__retres1, 0bv32)) && ~bvule32(\result, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && 2bv32 == m_st) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || ((((((((((~bvule32(2bv32, E_M) && ~bvule32(__retres1, 0bv32)) && ~bvule32(\result, 0bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && 2bv32 == m_st) && 1bv32 == t1_i) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || ((((((((((((((((~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33)) && ~bvule32(2bv32, E_M)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(\result, 0bv32)) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && local == token) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || ((((((((((((~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33)) && ~bvule32(2bv32, E_M)) && ~bvule34(~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)), ~bvadd16(~zero_extendFrom32To34(token), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)[32:32] ++ 0bv32)))) && ~bvult64(~bvadd16(~zero_extendFrom32To34(token), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)[32:32] ++ 0bv32)), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 2bv33)))) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) - InvariantResult [Line: 283]: Loop Invariant Derived loop invariant: ((((((((((((((((((((~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33)) && ~bvule32(2bv32, E_M)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(\result, 0bv32)) && t1_st == 0bv32) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && 2bv32 == m_st) && local == token) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) || ((((((((((((((~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33)) && ~bvule32(2bv32, E_M)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(\result, 0bv32)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && 2bv32 == m_st) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || ((((((((((((((((~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33)) && ~bvule32(2bv32, E_M)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(\result, 0bv32)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && local == token) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || ((((((((((((((~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33)) && ~bvule32(2bv32, E_M)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(\result, 0bv32)) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && 2bv32 == m_st) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || (((((((((((~bvule32(2bv32, E_M) && ~bvule32(__retres1, 0bv32)) && ~bvule32(\result, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && 2bv32 == m_st) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || ((((((((((~bvule32(2bv32, E_M) && ~bvule32(__retres1, 0bv32)) && ~bvule32(\result, 0bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && 2bv32 == m_st) && 1bv32 == t1_i) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || ((((((((((((((((~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33)) && ~bvule32(2bv32, E_M)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(\result, 0bv32)) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && local == token) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || ((((((((((((((((~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33)) && ~bvule32(2bv32, E_M)) && ~bvule32(__retres1, 0bv32)) && ~bvule34(~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)), ~bvadd16(~zero_extendFrom32To34(token), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)[32:32] ++ 0bv32)))) && ~bvule32(\result, 0bv32)) && ~bvult64(~bvadd16(~zero_extendFrom32To34(token), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)[32:32] ++ 0bv32)), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 2bv33)))) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) - InvariantResult [Line: 40]: Loop Invariant Derived loop invariant: (((((((((((((((~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33)) && ~bvule32(2bv32, E_M)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(\result, 0bv32)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && 2bv32 == m_st) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) || (((((((((((~bvule32(2bv32, E_M) && ~bvule32(__retres1, 0bv32)) && ~bvule32(\result, 0bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && 2bv32 == m_st) && local == token) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || ((((((((((((~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33)) && ~bvule32(2bv32, E_M)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(\result, 0bv32)) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && 2bv32 == m_st) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) - InvariantResult [Line: 311]: Loop Invariant Derived loop invariant: (((((((((((~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33)) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && 2bv32 == m_st) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) || ((((((((((~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33)) && ~bvule34(~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)), ~bvadd16(~zero_extendFrom32To34(token), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)[32:32] ++ 0bv32)))) && ~bvult64(~bvadd16(~zero_extendFrom32To34(token), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)[32:32] ++ 0bv32)), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 2bv33)))) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32))) || (((((((((~bvule32(__retres1, 0bv32) && ~bvule32(\result, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && 2bv32 == m_st) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) - InvariantResult [Line: 311]: Loop Invariant Derived loop invariant: (((((((((((((~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33)) && ~bvule32(2bv32, E_M)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(\result, 0bv32)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, T1_E)) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) || ((((((((((~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33)) && ~bvule32(2bv32, E_M)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(\result, 0bv32)) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(2bv32, T1_E)) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || (((((((((~bvule32(2bv32, E_M) && ~bvule32(__retres1, 0bv32)) && ~bvule32(\result, 0bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, T1_E)) && local == token) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) - InvariantResult [Line: 255]: Loop Invariant Derived loop invariant: (((((((((~bvule32(2bv32, E_M) && !(0bv33 == ~bvadd16(8589934591bv33, ~zero_extendFrom32To33(t1_pc)))) && 0bv33 == ~bvadd16(8589934590bv33, ~zero_extendFrom32To33(M_E))) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && 0bv65 == ~bvadd16(~sign_extendFrom8To32(~bvmul64(18446744073709551615bv64, ~zero_extendFrom32To64(local))), ~zero_extendFrom32To65(token))) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && 1bv32 == t1_i) || ((((((((~bvule32(2bv32, E_M) && !(0bv33 == ~bvadd16(8589934591bv33, ~zero_extendFrom32To33(t1_pc)))) && 0bv33 == ~bvadd16(8589934590bv33, ~zero_extendFrom32To33(M_E))) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && 0bv33 == ~bvadd16(8589934590bv33, ~zero_extendFrom32To33(m_st))) && 1bv32 == t1_i) - InvariantResult [Line: 120]: Loop Invariant Derived loop invariant: (((((((((((((((~bvule32(2bv32, E_M) && ~bvule32(__retres1, 0bv32)) && ~bvule32(\result, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && 2bv32 == m_st) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) || ((((((((((((~bvule32(2bv32, E_M) && ~bvule32(__retres1, 0bv32)) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && local == token) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32))) || ((((((((((~bvule32(2bv32, E_M) && ~bvule32(__retres1, 0bv32)) && ~bvule32(\result, 0bv32)) && t1_st == 0bv32) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && 2bv32 == m_st) && local == token) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32))) || ((((((((~bvule32(2bv32, E_M) && ~bvule32(__retres1, 0bv32)) && ~bvule32(\result, 0bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && 2bv32 == m_st) && 1bv32 == t1_i)) || ((((((((((((~bvule32(2bv32, E_M) && ~bvule32(__retres1, 0bv32)) && ~bvule32(\result, 0bv32)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && local == token) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32))) || ((((((((((((~bvule32(2bv32, E_M) && ~bvule32(__retres1, 0bv32)) && ~bvule34(~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)), ~bvadd16(~zero_extendFrom32To34(token), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)[32:32] ++ 0bv32)))) && ~bvule32(\result, 0bv32)) && ~bvult64(~bvadd16(~zero_extendFrom32To34(token), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)[32:32] ++ 0bv32)), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 2bv33)))) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32))) || ((((((((((~bvule32(2bv32, E_M) && ~bvule32(__retres1, 0bv32)) && ~bvule32(\result, 0bv32)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && 2bv32 == m_st) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32))) || ((((((((((~bvule32(2bv32, E_M) && ~bvule32(__retres1, 0bv32)) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && 2bv32 == m_st) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) - InvariantResult [Line: 123]: Loop Invariant Derived loop invariant: (((((((~bvule32(2bv32, E_M) && ~bvule32(__retres1, 0bv32)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, T1_E)) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) || ((((((((~bvule32(2bv32, E_M) && ~bvule32(__retres1, 0bv32)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, T1_E)) && local == token) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) - InvariantResult [Line: 139]: Loop Invariant Derived loop invariant: ((((((((((((((((((((~bvule32(2bv32, E_M) && ~bvule32(__retres1, 0bv32)) && ~bvule32(\result, 0bv32)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && local == token) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) || (((((((((((~bvule32(2bv32, E_M) && ~bvule32(__retres1, 0bv32)) && ~bvule32(\result, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && 2bv32 == m_st) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || ((((((((((~bvule32(2bv32, E_M) && ~bvule32(__retres1, 0bv32)) && ~bvule32(\result, 0bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && 2bv32 == m_st) && 1bv32 == t1_i) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || ((((((((((((((~bvule32(2bv32, E_M) && ~bvule32(__retres1, 0bv32)) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && local == token) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || ((((((((((((((~bvule32(2bv32, E_M) && ~bvule32(__retres1, 0bv32)) && ~bvule34(~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)), ~bvadd16(~zero_extendFrom32To34(token), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)[32:32] ++ 0bv32)))) && ~bvule32(\result, 0bv32)) && ~bvult64(~bvadd16(~zero_extendFrom32To34(token), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)[32:32] ++ 0bv32)), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 2bv33)))) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || ((((((((((((~bvule32(2bv32, E_M) && ~bvule32(__retres1, 0bv32)) && ~bvule32(\result, 0bv32)) && t1_st == 0bv32) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && 2bv32 == m_st) && local == token) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || ((((((((((((~bvule32(2bv32, E_M) && ~bvule32(__retres1, 0bv32)) && ~bvule32(\result, 0bv32)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && 2bv32 == m_st) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || ((((((((((((~bvule32(2bv32, E_M) && ~bvule32(__retres1, 0bv32)) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && 2bv32 == m_st) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) - InvariantResult [Line: 123]: Loop Invariant Derived loop invariant: (((((((((((((((((~bvule32(2bv32, E_M) && ~bvule32(__retres1, 0bv32)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && local == token) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) || (((((((((~bvule32(2bv32, E_M) && ~bvule32(__retres1, 0bv32)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && 2bv32 == m_st) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32))) || (((((((((((~bvule32(2bv32, E_M) && ~bvule32(__retres1, 0bv32)) && ~bvule34(~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)), ~bvadd16(~zero_extendFrom32To34(token), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)[32:32] ++ 0bv32)))) && ~bvult64(~bvadd16(~zero_extendFrom32To34(token), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)[32:32] ++ 0bv32)), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 2bv33)))) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32))) || ((((((((~bvule32(2bv32, E_M) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && 2bv32 == m_st) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i)) || (((((((((((~bvule32(2bv32, E_M) && ~bvule32(__retres1, 0bv32)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && local == token) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32))) || (((((((((~bvule32(2bv32, E_M) && ~bvule32(__retres1, 0bv32)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && 2bv32 == m_st) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32))) || (((((((~bvule32(2bv32, E_M) && ~bvule32(__retres1, 0bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && 2bv32 == m_st) && 1bv32 == t1_i)) || (((((((((~bvule32(2bv32, E_M) && ~bvule32(__retres1, 0bv32)) && t1_st == 0bv32) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && 2bv32 == m_st) && local == token) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) - InvariantResult [Line: 120]: Loop Invariant Derived loop invariant: ((((((((((~bvule32(2bv32, E_M) && ~bvule32(__retres1, 0bv32)) && !(0bv33 == ~bvadd16(8589934591bv33, ~zero_extendFrom32To33(t1_pc)))) && ~bvule32(\result, 0bv32)) && 0bv33 == ~bvadd16(8589934590bv33, ~zero_extendFrom32To33(M_E))) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && 0bv33 == ~bvadd16(8589934590bv33, ~zero_extendFrom32To33(m_st))) && 1bv32 == t1_i) || (((((((((((~bvule32(2bv32, E_M) && ~bvule32(__retres1, 0bv32)) && !(0bv33 == ~bvadd16(8589934591bv33, ~zero_extendFrom32To33(t1_pc)))) && ~bvule32(\result, 0bv32)) && 0bv33 == ~bvadd16(8589934590bv33, ~zero_extendFrom32To33(M_E))) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && 0bv65 == ~bvadd16(~sign_extendFrom8To32(~bvmul64(18446744073709551615bv64, ~zero_extendFrom32To64(local))), ~zero_extendFrom32To65(token))) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && 1bv32 == t1_i) - InvariantResult [Line: 356]: Loop Invariant Derived loop invariant: ((((((((((((((((((((~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33)) && ~bvule32(2bv32, E_M)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(\result, 0bv32)) && t1_st == 0bv32) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && 2bv32 == m_st) && local == token) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) || ((((((((((((((~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33)) && ~bvule32(2bv32, E_M)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(\result, 0bv32)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && 2bv32 == m_st) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || ((((((((((((((((~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33)) && ~bvule32(2bv32, E_M)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(\result, 0bv32)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && local == token) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || ((((((((((((((~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33)) && ~bvule32(2bv32, E_M)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(\result, 0bv32)) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && 2bv32 == m_st) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || (((((((((((~bvule32(2bv32, E_M) && ~bvule32(__retres1, 0bv32)) && ~bvule32(\result, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && 2bv32 == m_st) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || ((((((((((~bvule32(2bv32, E_M) && ~bvule32(__retres1, 0bv32)) && ~bvule32(\result, 0bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && 2bv32 == m_st) && 1bv32 == t1_i) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || ((((((((((((((((~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33)) && ~bvule32(2bv32, E_M)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(\result, 0bv32)) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && local == token) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || ((((((((((((((((~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33)) && ~bvule32(2bv32, E_M)) && ~bvule32(__retres1, 0bv32)) && ~bvule34(~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)), ~bvadd16(~zero_extendFrom32To34(token), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)[32:32] ++ 0bv32)))) && ~bvule32(\result, 0bv32)) && ~bvult64(~bvadd16(~zero_extendFrom32To34(token), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)[32:32] ++ 0bv32)), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 2bv33)))) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) - InvariantResult [Line: 43]: Loop Invariant Derived loop invariant: ((((((((((~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33)) && ~bvule32(2bv32, E_M)) && ~bvule34(~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)), ~bvadd16(~zero_extendFrom32To34(token), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)[32:32] ++ 0bv32)))) && ~bvult64(~bvadd16(~zero_extendFrom32To34(token), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)[32:32] ++ 0bv32)), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 2bv33)))) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32) - InvariantResult [Line: 384]: Loop Invariant Derived loop invariant: ((((((((~bvule32(2bv32, E_M) && !(0bv33 == ~bvadd16(8589934591bv33, ~zero_extendFrom32To33(t1_pc)))) && 0bv33 == ~bvadd16(8589934590bv33, ~zero_extendFrom32To33(M_E))) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && 0bv65 == ~bvadd16(~sign_extendFrom8To32(~bvmul64(18446744073709551615bv64, ~zero_extendFrom32To64(local))), ~zero_extendFrom32To65(token))) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && 1bv32 == t1_i - InvariantResult [Line: 120]: Loop Invariant Derived loop invariant: (((((((((((((((((~bvule32(2bv32, E_M) && ~bvule32(__retres1, 0bv32)) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && local == token) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) || ((((((((~bvule32(2bv32, E_M) && ~bvule32(__retres1, 0bv32)) && ~bvule32(\result, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && 2bv32 == m_st) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i)) || ((((((((~bvule32(2bv32, E_M) && ~bvule32(__retres1, 0bv32)) && ~bvule32(\result, 0bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && 2bv32 == m_st) && 1bv32 == t1_i)) || ((((((((((((~bvule32(2bv32, E_M) && ~bvule32(__retres1, 0bv32)) && ~bvule32(\result, 0bv32)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && local == token) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32))) || ((((((((((((~bvule32(2bv32, E_M) && ~bvule32(__retres1, 0bv32)) && ~bvule34(~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)), ~bvadd16(~zero_extendFrom32To34(token), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)[32:32] ++ 0bv32)))) && ~bvule32(\result, 0bv32)) && ~bvult64(~bvadd16(~zero_extendFrom32To34(token), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)[32:32] ++ 0bv32)), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 2bv33)))) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32))) || (((((((((~bvule32(2bv32, E_M) && ~bvule32(__retres1, 0bv32)) && ~bvule32(\result, 0bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && 2bv32 == m_st) && local == token) && t1_pc == 1bv32) && 1bv32 == t1_i)) || ((((((((((~bvule32(2bv32, E_M) && ~bvule32(__retres1, 0bv32)) && ~bvule32(\result, 0bv32)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && 2bv32 == m_st) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) - InvariantResult [Line: 187]: Loop Invariant Derived loop invariant: ((((((((((((((((((((~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33)) && ~bvule32(2bv32, E_M)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(\result, 0bv32)) && t1_st == 0bv32) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && 2bv32 == m_st) && local == token) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) || ((((((((((((((~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33)) && ~bvule32(2bv32, E_M)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(\result, 0bv32)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && 2bv32 == m_st) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || ((((((((((((((((~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33)) && ~bvule32(2bv32, E_M)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(\result, 0bv32)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && local == token) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || ((((((((((((((~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33)) && ~bvule32(2bv32, E_M)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(\result, 0bv32)) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && 2bv32 == m_st) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || (((((((((((~bvule32(2bv32, E_M) && ~bvule32(__retres1, 0bv32)) && ~bvule32(\result, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && 2bv32 == m_st) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || ((((((((((~bvule32(2bv32, E_M) && ~bvule32(__retres1, 0bv32)) && ~bvule32(\result, 0bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && 2bv32 == m_st) && 1bv32 == t1_i) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || ((((((((((((((((~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33)) && ~bvule32(2bv32, E_M)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(\result, 0bv32)) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && local == token) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || ((((((((((((((((~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33)) && ~bvule32(2bv32, E_M)) && ~bvule32(__retres1, 0bv32)) && ~bvule34(~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)), ~bvadd16(~zero_extendFrom32To34(token), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)[32:32] ++ 0bv32)))) && ~bvule32(\result, 0bv32)) && ~bvult64(~bvadd16(~zero_extendFrom32To34(token), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)[32:32] ++ 0bv32)), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 2bv33)))) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) - InvariantResult [Line: 158]: Loop Invariant Derived loop invariant: ((((((((((((((((((((~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33)) && ~bvule32(2bv32, E_M)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(\result, 0bv32)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && 2bv32 == m_st) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) || ((((((((((((((((~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33)) && ~bvule32(2bv32, E_M)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(\result, 0bv32)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && local == token) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || (((((((((((~bvule32(2bv32, E_M) && ~bvule32(__retres1, 0bv32)) && ~bvule32(\result, 0bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && 2bv32 == m_st) && local == token) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || ((((((((((~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33)) && ~bvule32(2bv32, E_M)) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && 2bv32 == m_st) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || (((((((((((~bvule32(2bv32, E_M) && ~bvule32(__retres1, 0bv32)) && ~bvule32(\result, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && 2bv32 == m_st) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || ((((((((((~bvule32(2bv32, E_M) && ~bvule32(__retres1, 0bv32)) && ~bvule32(\result, 0bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && 2bv32 == m_st) && 1bv32 == t1_i) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || ((((((((((((((((~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33)) && ~bvule32(2bv32, E_M)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(\result, 0bv32)) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && local == token) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || ((((((((((((~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33)) && ~bvule32(2bv32, E_M)) && ~bvule34(~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)), ~bvadd16(~zero_extendFrom32To34(token), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)[32:32] ++ 0bv32)))) && ~bvult64(~bvadd16(~zero_extendFrom32To34(token), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)[32:32] ++ 0bv32)), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 2bv33)))) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) - InvariantResult [Line: 283]: Loop Invariant Derived loop invariant: (((((((((((((((((~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33)) && ~bvule32(2bv32, E_M)) && ~bvule32(__retres1, 0bv32)) && !(0bv33 == ~bvadd16(8589934591bv33, ~zero_extendFrom32To33(t1_pc)))) && ~bvule32(\result, 0bv32)) && 0bv33 == ~bvadd16(8589934590bv33, ~zero_extendFrom32To33(M_E))) && t1_st == 0bv32) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && 0bv65 == ~bvadd16(~sign_extendFrom8To32(~bvmul64(18446744073709551615bv64, ~zero_extendFrom32To64(local))), ~zero_extendFrom32To65(token))) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) || ((((((((((((~bvule32(2bv32, E_M) && ~bvule32(__retres1, 0bv32)) && !(0bv33 == ~bvadd16(8589934591bv33, ~zero_extendFrom32To33(t1_pc)))) && ~bvule32(\result, 0bv32)) && 0bv33 == ~bvadd16(8589934590bv33, ~zero_extendFrom32To33(M_E))) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && 0bv33 == ~bvadd16(8589934590bv33, ~zero_extendFrom32To33(m_st))) && 1bv32 == t1_i) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) - InvariantResult [Line: 187]: Loop Invariant Derived loop invariant: ((((((((((((((((((((~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33)) && ~bvule32(2bv32, E_M)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(\result, 0bv32)) && t1_st == 0bv32) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && 2bv32 == m_st) && local == token) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) || ((((((((((((((~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33)) && ~bvule32(2bv32, E_M)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(\result, 0bv32)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && 2bv32 == m_st) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || ((((((((((((((((~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33)) && ~bvule32(2bv32, E_M)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(\result, 0bv32)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && local == token) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || ((((((((((((((~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33)) && ~bvule32(2bv32, E_M)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(\result, 0bv32)) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && 2bv32 == m_st) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || (((((((((((~bvule32(2bv32, E_M) && ~bvule32(__retres1, 0bv32)) && ~bvule32(\result, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && 2bv32 == m_st) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || ((((((((((~bvule32(2bv32, E_M) && ~bvule32(__retres1, 0bv32)) && ~bvule32(\result, 0bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && 2bv32 == m_st) && 1bv32 == t1_i) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || ((((((((((((((((~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33)) && ~bvule32(2bv32, E_M)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(\result, 0bv32)) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && local == token) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || ((((((((((((((((~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33)) && ~bvule32(2bv32, E_M)) && ~bvule32(__retres1, 0bv32)) && ~bvule34(~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)), ~bvadd16(~zero_extendFrom32To34(token), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)[32:32] ++ 0bv32)))) && ~bvule32(\result, 0bv32)) && ~bvult64(~bvadd16(~zero_extendFrom32To34(token), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)[32:32] ++ 0bv32)), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 2bv33)))) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) - InvariantResult [Line: 142]: Loop Invariant Derived loop invariant: ((((((((((((~bvule32(2bv32, E_M) && ~bvule32(__retres1, 0bv32)) && !(0bv33 == ~bvadd16(8589934591bv33, ~zero_extendFrom32To33(t1_pc)))) && ~bvule32(\result, 0bv32)) && 0bv33 == ~bvadd16(8589934590bv33, ~zero_extendFrom32To33(M_E))) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && 0bv33 == ~bvadd16(8589934590bv33, ~zero_extendFrom32To33(m_st))) && 1bv32 == t1_i) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) || ((((((((((((((~bvule32(2bv32, E_M) && ~bvule32(__retres1, 0bv32)) && !(0bv33 == ~bvadd16(8589934591bv33, ~zero_extendFrom32To33(t1_pc)))) && ~bvule32(\result, 0bv32)) && 0bv33 == ~bvadd16(8589934590bv33, ~zero_extendFrom32To33(M_E))) && t1_st == 0bv32) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && 0bv65 == ~bvadd16(~sign_extendFrom8To32(~bvmul64(18446744073709551615bv64, ~zero_extendFrom32To64(local))), ~zero_extendFrom32To65(token))) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && 1bv32 == t1_i) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) - InvariantResult [Line: 472]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 139]: Loop Invariant Derived loop invariant: ((((((((((((((((((((~bvule32(2bv32, E_M) && ~bvule32(__retres1, 0bv32)) && ~bvule32(\result, 0bv32)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && local == token) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) || (((((((((((~bvule32(2bv32, E_M) && ~bvule32(__retres1, 0bv32)) && ~bvule32(\result, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && 2bv32 == m_st) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || ((((((((((~bvule32(2bv32, E_M) && ~bvule32(__retres1, 0bv32)) && ~bvule32(\result, 0bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && 2bv32 == m_st) && 1bv32 == t1_i) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || ((((((((((((((~bvule32(2bv32, E_M) && ~bvule32(__retres1, 0bv32)) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && local == token) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || ((((((((((((((~bvule32(2bv32, E_M) && ~bvule32(__retres1, 0bv32)) && ~bvule34(~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)), ~bvadd16(~zero_extendFrom32To34(token), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)[32:32] ++ 0bv32)))) && ~bvule32(\result, 0bv32)) && ~bvult64(~bvadd16(~zero_extendFrom32To34(token), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)[32:32] ++ 0bv32)), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 2bv33)))) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || ((((((((((((~bvule32(2bv32, E_M) && ~bvule32(__retres1, 0bv32)) && ~bvule32(\result, 0bv32)) && t1_st == 0bv32) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && 2bv32 == m_st) && local == token) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || ((((((((((((~bvule32(2bv32, E_M) && ~bvule32(__retres1, 0bv32)) && ~bvule32(\result, 0bv32)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && 2bv32 == m_st) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || ((((((((((((~bvule32(2bv32, E_M) && ~bvule32(__retres1, 0bv32)) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && 2bv32 == m_st) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) - InvariantResult [Line: 184]: Loop Invariant Derived loop invariant: ((((((((((((((((((((~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33)) && ~bvule32(2bv32, E_M)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(\result, 0bv32)) && t1_st == 0bv32) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && 2bv32 == m_st) && local == token) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) || ((((((((((((((~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33)) && ~bvule32(2bv32, E_M)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(\result, 0bv32)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && 2bv32 == m_st) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || ((((((((((((((((~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33)) && ~bvule32(2bv32, E_M)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(\result, 0bv32)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && local == token) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || ((((((((((((((~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33)) && ~bvule32(2bv32, E_M)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(\result, 0bv32)) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && 2bv32 == m_st) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || (((((((((((~bvule32(2bv32, E_M) && ~bvule32(__retres1, 0bv32)) && ~bvule32(\result, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && 2bv32 == m_st) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || ((((((((((~bvule32(2bv32, E_M) && ~bvule32(__retres1, 0bv32)) && ~bvule32(\result, 0bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && 2bv32 == m_st) && 1bv32 == t1_i) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || ((((((((((((((((~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33)) && ~bvule32(2bv32, E_M)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(\result, 0bv32)) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && local == token) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || ((((((((((((((((~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33)) && ~bvule32(2bv32, E_M)) && ~bvule32(__retres1, 0bv32)) && ~bvule34(~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)), ~bvadd16(~zero_extendFrom32To34(token), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)[32:32] ++ 0bv32)))) && ~bvule32(\result, 0bv32)) && ~bvult64(~bvadd16(~zero_extendFrom32To34(token), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)[32:32] ++ 0bv32)), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 2bv33)))) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) - InvariantResult [Line: 347]: Loop Invariant Derived loop invariant: ((((((((((((((((((((~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33)) && ~bvule32(2bv32, E_M)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(\result, 0bv32)) && t1_st == 0bv32) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && 2bv32 == m_st) && local == token) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) || ((((((((((((((~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33)) && ~bvule32(2bv32, E_M)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(\result, 0bv32)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && 2bv32 == m_st) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || ((((((((((((((((~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33)) && ~bvule32(2bv32, E_M)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(\result, 0bv32)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && local == token) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || ((((((((((((((~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33)) && ~bvule32(2bv32, E_M)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(\result, 0bv32)) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && 2bv32 == m_st) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || (((((((((((~bvule32(2bv32, E_M) && ~bvule32(__retres1, 0bv32)) && ~bvule32(\result, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && 2bv32 == m_st) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || ((((((((((~bvule32(2bv32, E_M) && ~bvule32(__retres1, 0bv32)) && ~bvule32(\result, 0bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && 2bv32 == m_st) && 1bv32 == t1_i) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || ((((((((((((((((~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33)) && ~bvule32(2bv32, E_M)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(\result, 0bv32)) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && local == token) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || ((((((((((((((((~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33)) && ~bvule32(2bv32, E_M)) && ~bvule32(__retres1, 0bv32)) && ~bvule34(~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)), ~bvadd16(~zero_extendFrom32To34(token), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)[32:32] ++ 0bv32)))) && ~bvule32(\result, 0bv32)) && ~bvult64(~bvadd16(~zero_extendFrom32To34(token), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)[32:32] ++ 0bv32)), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 2bv33)))) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) - InvariantResult [Line: 16]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 139]: Loop Invariant Derived loop invariant: (((((((((~bvule34(~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)), ~bvadd16(~zero_extendFrom32To34(token), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)[32:32] ++ 0bv32))) && ~bvult64(~bvadd16(~zero_extendFrom32To34(token), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)[32:32] ++ 0bv32)), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 2bv33)))) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) || ((((((((~bvule32(__retres1, 0bv32) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && 2bv32 == m_st) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || (((((((((~bvule32(__retres1, 0bv32) && ~bvule32(\result, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && 2bv32 == m_st) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) - InvariantResult [Line: 336]: Loop Invariant Derived loop invariant: (((((((((((((~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33)) && ~bvule32(2bv32, E_M)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(\result, 0bv32)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, T1_E)) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) || ((((((((((~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33)) && ~bvule32(2bv32, E_M)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(\result, 0bv32)) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(2bv32, T1_E)) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || (((((((((~bvule32(2bv32, E_M) && ~bvule32(__retres1, 0bv32)) && ~bvule32(\result, 0bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, T1_E)) && local == token) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) - InvariantResult [Line: 394]: Loop Invariant Derived loop invariant: ((((((((((((((((((((~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33)) && ~bvule32(2bv32, E_M)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(\result, 0bv32)) && t1_st == 0bv32) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && 2bv32 == m_st) && local == token) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) || ((((((((((((((~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33)) && ~bvule32(2bv32, E_M)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(\result, 0bv32)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && 2bv32 == m_st) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || ((((((((((((((((~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33)) && ~bvule32(2bv32, E_M)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(\result, 0bv32)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && local == token) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || ((((((((((((((~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33)) && ~bvule32(2bv32, E_M)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(\result, 0bv32)) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && 2bv32 == m_st) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || (((((((((((~bvule32(2bv32, E_M) && ~bvule32(__retres1, 0bv32)) && ~bvule32(\result, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && 2bv32 == m_st) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || ((((((((((~bvule32(2bv32, E_M) && ~bvule32(__retres1, 0bv32)) && ~bvule32(\result, 0bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && 2bv32 == m_st) && 1bv32 == t1_i) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || ((((((((((((((((~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33)) && ~bvule32(2bv32, E_M)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(\result, 0bv32)) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && local == token) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || ((((((((((((((((~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33)) && ~bvule32(2bv32, E_M)) && ~bvule32(__retres1, 0bv32)) && ~bvule34(~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)), ~bvadd16(~zero_extendFrom32To34(token), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)[32:32] ++ 0bv32)))) && ~bvule32(\result, 0bv32)) && ~bvult64(~bvadd16(~zero_extendFrom32To34(token), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)[32:32] ++ 0bv32)), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 2bv33)))) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) - InvariantResult [Line: 120]: Loop Invariant Derived loop invariant: ((((((~bvule34(~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)), ~bvadd16(~zero_extendFrom32To34(token), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)[32:32] ++ 0bv32))) && ~bvult64(~bvadd16(~zero_extendFrom32To34(token), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)[32:32] ++ 0bv32)), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 2bv33)))) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && 2bv32 == m_st) && t1_pc == 1bv32) && 1bv32 == t1_i) || ((((((~bvule32(__retres1, 0bv32) && ~bvule32(\result, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && 2bv32 == m_st) && t1_pc == 1bv32) && 1bv32 == t1_i) - InvariantResult [Line: 311]: Loop Invariant Derived loop invariant: (((((((((((((((((~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33)) && ~bvule32(2bv32, E_M)) && ~bvule32(__retres1, 0bv32)) && !(0bv33 == ~bvadd16(8589934591bv33, ~zero_extendFrom32To33(t1_pc)))) && ~bvule32(\result, 0bv32)) && 0bv33 == ~bvadd16(8589934590bv33, ~zero_extendFrom32To33(M_E))) && t1_st == 0bv32) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && 0bv65 == ~bvadd16(~sign_extendFrom8To32(~bvmul64(18446744073709551615bv64, ~zero_extendFrom32To64(local))), ~zero_extendFrom32To65(token))) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) || ((((((((((((~bvule32(2bv32, E_M) && ~bvule32(__retres1, 0bv32)) && !(0bv33 == ~bvadd16(8589934591bv33, ~zero_extendFrom32To33(t1_pc)))) && ~bvule32(\result, 0bv32)) && 0bv33 == ~bvadd16(8589934590bv33, ~zero_extendFrom32To33(M_E))) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && 0bv33 == ~bvadd16(8589934590bv33, ~zero_extendFrom32To33(m_st))) && 1bv32 == t1_i) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) - InvariantResult [Line: 187]: Loop Invariant Derived loop invariant: ((((((((((((((((((((~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33)) && ~bvule32(2bv32, E_M)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(\result, 0bv32)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && 2bv32 == m_st) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) || ((((((((((((((((~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33)) && ~bvule32(2bv32, E_M)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(\result, 0bv32)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && local == token) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || (((((((((((~bvule32(2bv32, E_M) && ~bvule32(__retres1, 0bv32)) && ~bvule32(\result, 0bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && 2bv32 == m_st) && local == token) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || ((((((((((~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33)) && ~bvule32(2bv32, E_M)) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && 2bv32 == m_st) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || (((((((((((~bvule32(2bv32, E_M) && ~bvule32(__retres1, 0bv32)) && ~bvule32(\result, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && 2bv32 == m_st) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || ((((((((((~bvule32(2bv32, E_M) && ~bvule32(__retres1, 0bv32)) && ~bvule32(\result, 0bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && 2bv32 == m_st) && 1bv32 == t1_i) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || ((((((((((((((((~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33)) && ~bvule32(2bv32, E_M)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(\result, 0bv32)) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && local == token) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || ((((((((((((~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33)) && ~bvule32(2bv32, E_M)) && ~bvule34(~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)), ~bvadd16(~zero_extendFrom32To34(token), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)[32:32] ++ 0bv32)))) && ~bvult64(~bvadd16(~zero_extendFrom32To34(token), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)[32:32] ++ 0bv32)), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 2bv33)))) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) - InvariantResult [Line: 311]: Loop Invariant Derived loop invariant: ((((((((((((((((((((~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33)) && ~bvule32(2bv32, E_M)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(\result, 0bv32)) && t1_st == 0bv32) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && 2bv32 == m_st) && local == token) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) || ((((((((((((((~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33)) && ~bvule32(2bv32, E_M)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(\result, 0bv32)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && 2bv32 == m_st) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || ((((((((((((((((~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33)) && ~bvule32(2bv32, E_M)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(\result, 0bv32)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && local == token) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || ((((((((((((((~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33)) && ~bvule32(2bv32, E_M)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(\result, 0bv32)) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && 2bv32 == m_st) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || (((((((((((~bvule32(2bv32, E_M) && ~bvule32(__retres1, 0bv32)) && ~bvule32(\result, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && 2bv32 == m_st) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || ((((((((((~bvule32(2bv32, E_M) && ~bvule32(__retres1, 0bv32)) && ~bvule32(\result, 0bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && 2bv32 == m_st) && 1bv32 == t1_i) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || ((((((((((((((((~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33)) && ~bvule32(2bv32, E_M)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(\result, 0bv32)) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && local == token) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || ((((((((((((((((~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33)) && ~bvule32(2bv32, E_M)) && ~bvule32(__retres1, 0bv32)) && ~bvule34(~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)), ~bvadd16(~zero_extendFrom32To34(token), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)[32:32] ++ 0bv32)))) && ~bvule32(\result, 0bv32)) && ~bvult64(~bvadd16(~zero_extendFrom32To34(token), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)[32:32] ++ 0bv32)), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 2bv33)))) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) - InvariantResult [Line: 123]: Loop Invariant Derived loop invariant: (((((((((~bvule32(2bv32, E_M) && ~bvule32(__retres1, 0bv32)) && !(0bv33 == ~bvadd16(8589934591bv33, ~zero_extendFrom32To33(t1_pc)))) && 0bv33 == ~bvadd16(8589934590bv33, ~zero_extendFrom32To33(M_E))) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && 0bv33 == ~bvadd16(8589934590bv33, ~zero_extendFrom32To33(m_st))) && 1bv32 == t1_i) || ((((((((((~bvule32(2bv32, E_M) && ~bvule32(__retres1, 0bv32)) && !(0bv33 == ~bvadd16(8589934591bv33, ~zero_extendFrom32To33(t1_pc)))) && 0bv33 == ~bvadd16(8589934590bv33, ~zero_extendFrom32To33(M_E))) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && 0bv65 == ~bvadd16(~sign_extendFrom8To32(~bvmul64(18446744073709551615bv64, ~zero_extendFrom32To64(local))), ~zero_extendFrom32To65(token))) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && 1bv32 == t1_i) - InvariantResult [Line: 123]: Loop Invariant Derived loop invariant: (((((~bvule32(__retres1, 0bv32) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && 2bv32 == m_st) && t1_pc == 1bv32) && 1bv32 == t1_i) || ((((((~bvule34(~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)), ~bvadd16(~zero_extendFrom32To34(token), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)[32:32] ++ 0bv32))) && ~bvult64(~bvadd16(~zero_extendFrom32To34(token), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)[32:32] ++ 0bv32)), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 2bv33)))) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && 2bv32 == m_st) && t1_pc == 1bv32) && 1bv32 == t1_i) - InvariantResult [Line: 336]: Loop Invariant Derived loop invariant: (((((((((((~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33)) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && 2bv32 == m_st) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) || ((((((((((~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33)) && ~bvule34(~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)), ~bvadd16(~zero_extendFrom32To34(token), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)[32:32] ++ 0bv32)))) && ~bvult64(~bvadd16(~zero_extendFrom32To34(token), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)[32:32] ++ 0bv32)), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 2bv33)))) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32))) || (((((((((~bvule32(__retres1, 0bv32) && ~bvule32(\result, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && 2bv32 == m_st) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) - InvariantResult [Line: 87]: Loop Invariant Derived loop invariant: ((((((((((~bvule32(2bv32, E_M) && ~bvule32(__retres1, 0bv32)) && ~bvule32(\result, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && 2bv32 == m_st) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) || ((((((((((~bvule32(2bv32, E_M) && ~bvule32(__retres1, 0bv32)) && ~bvule32(\result, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && 2bv32 == m_st) && local == token) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) - InvariantResult [Line: 84]: Loop Invariant Derived loop invariant: (((((((((((((~bvule32(2bv32, E_M) && ~bvule32(__retres1, 0bv32)) && ~bvule32(\result, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && 2bv32 == m_st) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) || ((((((((((((~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33)) && ~bvule32(2bv32, E_M)) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && 2bv32 == m_st) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || ((((((((((((((((~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33)) && ~bvule32(2bv32, E_M)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(\result, 0bv32)) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && local == token) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || ((((((((((((~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33)) && ~bvule32(2bv32, E_M)) && ~bvule34(~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)), ~bvadd16(~zero_extendFrom32To34(token), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)[32:32] ++ 0bv32)))) && ~bvult64(~bvadd16(~zero_extendFrom32To34(token), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)[32:32] ++ 0bv32)), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 2bv33)))) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) - InvariantResult [Line: 184]: Loop Invariant Derived loop invariant: ((((((((((((((((((((~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33)) && ~bvule32(2bv32, E_M)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(\result, 0bv32)) && t1_st == 0bv32) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && 2bv32 == m_st) && local == token) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) || ((((((((((((((~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33)) && ~bvule32(2bv32, E_M)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(\result, 0bv32)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && 2bv32 == m_st) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || ((((((((((((((((~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33)) && ~bvule32(2bv32, E_M)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(\result, 0bv32)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && local == token) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || ((((((((((((((~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33)) && ~bvule32(2bv32, E_M)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(\result, 0bv32)) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && 2bv32 == m_st) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || (((((((((((~bvule32(2bv32, E_M) && ~bvule32(__retres1, 0bv32)) && ~bvule32(\result, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && 2bv32 == m_st) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || ((((((((((~bvule32(2bv32, E_M) && ~bvule32(__retres1, 0bv32)) && ~bvule32(\result, 0bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && 2bv32 == m_st) && 1bv32 == t1_i) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || ((((((((((((((((~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33)) && ~bvule32(2bv32, E_M)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(\result, 0bv32)) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && local == token) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || ((((((((((((((((~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33)) && ~bvule32(2bv32, E_M)) && ~bvule32(__retres1, 0bv32)) && ~bvule34(~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)), ~bvadd16(~zero_extendFrom32To34(token), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)[32:32] ++ 0bv32)))) && ~bvule32(\result, 0bv32)) && ~bvult64(~bvadd16(~zero_extendFrom32To34(token), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)[32:32] ++ 0bv32)), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 2bv33)))) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) - InvariantResult [Line: 87]: Loop Invariant Derived loop invariant: ((((((((((((~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33)) && ~bvule32(2bv32, E_M)) && ~bvule34(~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)), ~bvadd16(~zero_extendFrom32To34(token), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)[32:32] ++ 0bv32)))) && ~bvult64(~bvadd16(~zero_extendFrom32To34(token), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)[32:32] ++ 0bv32)), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 2bv33)))) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) || ((((((((((~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33)) && ~bvule32(2bv32, E_M)) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && 2bv32 == m_st) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || (((((((((~bvule32(2bv32, E_M) && ~bvule32(__retres1, 0bv32)) && ~bvule32(\result, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && 2bv32 == m_st) && 1bv32 == t1_i) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || ((((((((((((((~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33)) && ~bvule32(2bv32, E_M)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(\result, 0bv32)) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && local == token) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) - InvariantResult [Line: 428]: Loop Invariant Derived loop invariant: ((((((((((((((((((((~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33)) && ~bvule32(2bv32, E_M)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(\result, 0bv32)) && t1_st == 0bv32) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && 2bv32 == m_st) && local == token) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) || ((((((((((((((~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33)) && ~bvule32(2bv32, E_M)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(\result, 0bv32)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && 2bv32 == m_st) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || ((((((((((((((((~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33)) && ~bvule32(2bv32, E_M)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(\result, 0bv32)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && local == token) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || ((((((((((((((~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33)) && ~bvule32(2bv32, E_M)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(\result, 0bv32)) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && 2bv32 == m_st) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || (((((((((((~bvule32(2bv32, E_M) && ~bvule32(__retres1, 0bv32)) && ~bvule32(\result, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && 2bv32 == m_st) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || ((((((((((~bvule32(2bv32, E_M) && ~bvule32(__retres1, 0bv32)) && ~bvule32(\result, 0bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && 2bv32 == m_st) && 1bv32 == t1_i) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || ((((((((((((((((~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33)) && ~bvule32(2bv32, E_M)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(\result, 0bv32)) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && local == token) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || ((((((((((((((((~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33)) && ~bvule32(2bv32, E_M)) && ~bvule32(__retres1, 0bv32)) && ~bvule34(~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)), ~bvadd16(~zero_extendFrom32To34(token), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)[32:32] ++ 0bv32)))) && ~bvule32(\result, 0bv32)) && ~bvult64(~bvadd16(~zero_extendFrom32To34(token), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)[32:32] ++ 0bv32)), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 2bv33)))) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) - InvariantResult [Line: 139]: Loop Invariant Derived loop invariant: ((((((((((((~bvule32(2bv32, E_M) && ~bvule32(__retres1, 0bv32)) && !(0bv33 == ~bvadd16(8589934591bv33, ~zero_extendFrom32To33(t1_pc)))) && ~bvule32(\result, 0bv32)) && 0bv33 == ~bvadd16(8589934590bv33, ~zero_extendFrom32To33(M_E))) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && 0bv33 == ~bvadd16(8589934590bv33, ~zero_extendFrom32To33(m_st))) && 1bv32 == t1_i) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) || (((((((((((((((~bvule32(2bv32, E_M) && ~bvule32(__retres1, 0bv32)) && !(0bv33 == ~bvadd16(8589934591bv33, ~zero_extendFrom32To33(t1_pc)))) && ~bvule32(\result, 0bv32)) && 0bv33 == ~bvadd16(8589934590bv33, ~zero_extendFrom32To33(M_E))) && t1_st == 0bv32) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && 0bv65 == ~bvadd16(~sign_extendFrom8To32(~bvmul64(18446744073709551615bv64, ~zero_extendFrom32To64(local))), ~zero_extendFrom32To65(token))) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) - InvariantResult [Line: 142]: Loop Invariant Derived loop invariant: ((((((((((~bvule32(2bv32, E_M) && ~bvule32(__retres1, 0bv32)) && ~bvule32(\result, 0bv32)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, T1_E)) && 1bv32 == t1_i) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) || (((((((((~bvule32(2bv32, E_M) && ~bvule32(__retres1, 0bv32)) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, T1_E)) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || (((((((((~bvule32(2bv32, E_M) && ~bvule32(__retres1, 0bv32)) && ~bvule32(\result, 0bv32)) && ~bvule32(2bv32, T1_E)) && local == token) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) - InvariantResult [Line: 120]: Loop Invariant Derived loop invariant: (((((((((~bvule32(2bv32, E_M) && ~bvule32(__retres1, 0bv32)) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, T1_E)) && local == token) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) || ((((((((~bvule32(2bv32, E_M) && ~bvule32(__retres1, 0bv32)) && ~bvule32(\result, 0bv32)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, T1_E)) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) - InvariantResult [Line: 158]: Loop Invariant Derived loop invariant: ((((((((~bvule32(2bv32, E_M) && !(0bv33 == ~bvadd16(8589934591bv33, ~zero_extendFrom32To33(t1_pc)))) && 0bv33 == ~bvadd16(8589934590bv33, ~zero_extendFrom32To33(M_E))) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && 0bv65 == ~bvadd16(~sign_extendFrom8To32(~bvmul64(18446744073709551615bv64, ~zero_extendFrom32To64(local))), ~zero_extendFrom32To65(token))) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && 1bv32 == t1_i - InvariantResult [Line: 166]: Loop Invariant Derived loop invariant: (((((((((~bvule32(2bv32, E_M) && !(0bv33 == ~bvadd16(8589934591bv33, ~zero_extendFrom32To33(t1_pc)))) && 0bv33 == ~bvadd16(8589934590bv33, ~zero_extendFrom32To33(M_E))) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && 0bv65 == ~bvadd16(~sign_extendFrom8To32(~bvmul64(18446744073709551615bv64, ~zero_extendFrom32To64(local))), ~zero_extendFrom32To65(token))) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && 1bv32 == t1_i) || ((((((((~bvule32(2bv32, E_M) && !(0bv33 == ~bvadd16(8589934591bv33, ~zero_extendFrom32To33(t1_pc)))) && 0bv33 == ~bvadd16(8589934590bv33, ~zero_extendFrom32To33(M_E))) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && 0bv33 == ~bvadd16(8589934590bv33, ~zero_extendFrom32To33(m_st))) && 1bv32 == t1_i) - InvariantResult [Line: 139]: Loop Invariant Derived loop invariant: (((((((((((~bvule32(2bv32, E_M) && ~bvule32(__retres1, 0bv32)) && ~bvule32(\result, 0bv32)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, T1_E)) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) || (((((((((~bvule32(2bv32, E_M) && ~bvule32(__retres1, 0bv32)) && ~bvule32(\result, 0bv32)) && ~bvule32(2bv32, T1_E)) && local == token) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || ((((((((((~bvule32(2bv32, E_M) && ~bvule32(__retres1, 0bv32)) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, T1_E)) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) - InvariantResult [Line: 398]: Loop Invariant Derived loop invariant: ((((((((((((((((((((~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33)) && ~bvule32(2bv32, E_M)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(\result, 0bv32)) && t1_st == 0bv32) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && 2bv32 == m_st) && local == token) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) || ((((((((((((((~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33)) && ~bvule32(2bv32, E_M)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(\result, 0bv32)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && 2bv32 == m_st) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || ((((((((((((((((~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33)) && ~bvule32(2bv32, E_M)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(\result, 0bv32)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && local == token) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || ((((((((((((((~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33)) && ~bvule32(2bv32, E_M)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(\result, 0bv32)) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && 2bv32 == m_st) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || (((((((((((~bvule32(2bv32, E_M) && ~bvule32(__retres1, 0bv32)) && ~bvule32(\result, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && 2bv32 == m_st) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || ((((((((((~bvule32(2bv32, E_M) && ~bvule32(__retres1, 0bv32)) && ~bvule32(\result, 0bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && 2bv32 == m_st) && 1bv32 == t1_i) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || ((((((((((((((((~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33)) && ~bvule32(2bv32, E_M)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(\result, 0bv32)) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && local == token) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || ((((((((((((((((~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33)) && ~bvule32(2bv32, E_M)) && ~bvule32(__retres1, 0bv32)) && ~bvule34(~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)), ~bvadd16(~zero_extendFrom32To34(token), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)[32:32] ++ 0bv32)))) && ~bvule32(\result, 0bv32)) && ~bvult64(~bvadd16(~zero_extendFrom32To34(token), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)[32:32] ++ 0bv32)), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 2bv33)))) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) - InvariantResult [Line: 142]: Loop Invariant Derived loop invariant: (((((((((((((((((((~bvule32(2bv32, E_M) && ~bvule32(__retres1, 0bv32)) && ~bvule32(\result, 0bv32)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && local == token) && 1bv32 == t1_i) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) || (((((((((((~bvule32(2bv32, E_M) && ~bvule32(__retres1, 0bv32)) && ~bvule32(\result, 0bv32)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && 2bv32 == m_st) && 1bv32 == t1_i) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || (((((((((((~bvule32(2bv32, E_M) && ~bvule32(__retres1, 0bv32)) && ~bvule32(\result, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && 2bv32 == m_st) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || (((((((((((~bvule32(2bv32, E_M) && ~bvule32(__retres1, 0bv32)) && ~bvule32(\result, 0bv32)) && t1_st == 0bv32) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && 2bv32 == m_st) && local == token) && 1bv32 == t1_i) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || (((((((((((~bvule32(2bv32, E_M) && ~bvule32(__retres1, 0bv32)) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && 2bv32 == m_st) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || ((((((((((~bvule32(2bv32, E_M) && ~bvule32(__retres1, 0bv32)) && ~bvule32(\result, 0bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && 2bv32 == m_st) && 1bv32 == t1_i) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || (((((((((((((~bvule32(2bv32, E_M) && ~bvule32(__retres1, 0bv32)) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && local == token) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || (((((((((((((~bvule32(2bv32, E_M) && ~bvule32(__retres1, 0bv32)) && ~bvule34(~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)), ~bvadd16(~zero_extendFrom32To34(token), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)[32:32] ++ 0bv32)))) && ~bvule32(\result, 0bv32)) && ~bvult64(~bvadd16(~zero_extendFrom32To34(token), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)[32:32] ++ 0bv32)), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 2bv33)))) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) - InvariantResult [Line: 255]: Loop Invariant Derived loop invariant: ((((((((((((((((((((~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33)) && ~bvule32(2bv32, E_M)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(\result, 0bv32)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && 2bv32 == m_st) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) || ((((((((((((((((~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33)) && ~bvule32(2bv32, E_M)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(\result, 0bv32)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && local == token) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || (((((((((((~bvule32(2bv32, E_M) && ~bvule32(__retres1, 0bv32)) && ~bvule32(\result, 0bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && 2bv32 == m_st) && local == token) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || ((((((((((~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33)) && ~bvule32(2bv32, E_M)) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && 2bv32 == m_st) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || (((((((((((~bvule32(2bv32, E_M) && ~bvule32(__retres1, 0bv32)) && ~bvule32(\result, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && 2bv32 == m_st) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || ((((((((((~bvule32(2bv32, E_M) && ~bvule32(__retres1, 0bv32)) && ~bvule32(\result, 0bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && 2bv32 == m_st) && 1bv32 == t1_i) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || ((((((((((((((((~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33)) && ~bvule32(2bv32, E_M)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(\result, 0bv32)) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && local == token) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || ((((((((((((~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33)) && ~bvule32(2bv32, E_M)) && ~bvule34(~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)), ~bvadd16(~zero_extendFrom32To34(token), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)[32:32] ++ 0bv32)))) && ~bvult64(~bvadd16(~zero_extendFrom32To34(token), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)[32:32] ++ 0bv32)), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 2bv33)))) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) - InvariantResult [Line: 43]: Loop Invariant Derived loop invariant: ((((((((((((~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33)) && ~bvule32(2bv32, E_M)) && ~bvule34(~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)), ~bvadd16(~zero_extendFrom32To34(token), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)[32:32] ++ 0bv32)))) && ~bvult64(~bvadd16(~zero_extendFrom32To34(token), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)[32:32] ++ 0bv32)), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 2bv33)))) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) || ((((((((((((((~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33)) && ~bvule32(2bv32, E_M)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(\result, 0bv32)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || (((((((((((~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33)) && ~bvule32(2bv32, E_M)) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && local == token) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) - InvariantResult [Line: 413]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 184]: Loop Invariant Derived loop invariant: ((((((((((((((((((((~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33)) && ~bvule32(2bv32, E_M)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(\result, 0bv32)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && 2bv32 == m_st) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) || ((((((((((((((((~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33)) && ~bvule32(2bv32, E_M)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(\result, 0bv32)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && local == token) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || (((((((((((~bvule32(2bv32, E_M) && ~bvule32(__retres1, 0bv32)) && ~bvule32(\result, 0bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && 2bv32 == m_st) && local == token) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || ((((((((((~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33)) && ~bvule32(2bv32, E_M)) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && 2bv32 == m_st) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || (((((((((((~bvule32(2bv32, E_M) && ~bvule32(__retres1, 0bv32)) && ~bvule32(\result, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && 2bv32 == m_st) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || ((((((((((~bvule32(2bv32, E_M) && ~bvule32(__retres1, 0bv32)) && ~bvule32(\result, 0bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && 2bv32 == m_st) && 1bv32 == t1_i) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || ((((((((((((((((~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33)) && ~bvule32(2bv32, E_M)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(\result, 0bv32)) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && local == token) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || ((((((((((((~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33)) && ~bvule32(2bv32, E_M)) && ~bvule34(~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)), ~bvadd16(~zero_extendFrom32To34(token), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)[32:32] ++ 0bv32)))) && ~bvult64(~bvadd16(~zero_extendFrom32To34(token), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)[32:32] ++ 0bv32)), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 2bv33)))) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) - InvariantResult [Line: 123]: Loop Invariant Derived loop invariant: ((((((((((((((((~bvule32(2bv32, E_M) && ~bvule32(__retres1, 0bv32)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && local == token) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) || (((((((((((~bvule32(2bv32, E_M) && ~bvule32(__retres1, 0bv32)) && ~bvule34(~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)), ~bvadd16(~zero_extendFrom32To34(token), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)[32:32] ++ 0bv32)))) && ~bvult64(~bvadd16(~zero_extendFrom32To34(token), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)[32:32] ++ 0bv32)), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 2bv33)))) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32))) || (((((((((((~bvule32(2bv32, E_M) && ~bvule32(__retres1, 0bv32)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && local == token) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32))) || (((((((((~bvule32(2bv32, E_M) && ~bvule32(__retres1, 0bv32)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && 2bv32 == m_st) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32))) || (((((((~bvule32(2bv32, E_M) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && 2bv32 == m_st) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i)) || (((((((~bvule32(2bv32, E_M) && ~bvule32(__retres1, 0bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && 2bv32 == m_st) && 1bv32 == t1_i)) || ((((((((~bvule32(2bv32, E_M) && ~bvule32(__retres1, 0bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && 2bv32 == m_st) && local == token) && t1_pc == 1bv32) && 1bv32 == t1_i) - InvariantResult [Line: 142]: Loop Invariant Derived loop invariant: ((((((((~bvule32(__retres1, 0bv32) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && 2bv32 == m_st) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) || (((((((~bvule34(~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)), ~bvadd16(~zero_extendFrom32To34(token), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)[32:32] ++ 0bv32))) && ~bvult64(~bvadd16(~zero_extendFrom32To34(token), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)[32:32] ++ 0bv32)), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 2bv33)))) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && t1_pc == 1bv32) && 1bv32 == t1_i)) || (((((((((~bvule32(__retres1, 0bv32) && ~bvule32(\result, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && 2bv32 == m_st) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) - InvariantResult [Line: 311]: Loop Invariant Derived loop invariant: ((((((((((((((((((((~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33)) && ~bvule32(2bv32, E_M)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(\result, 0bv32)) && t1_st == 0bv32) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && 2bv32 == m_st) && local == token) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) || ((((((((((((((~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33)) && ~bvule32(2bv32, E_M)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(\result, 0bv32)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && 2bv32 == m_st) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || ((((((((((((((((~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33)) && ~bvule32(2bv32, E_M)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(\result, 0bv32)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && local == token) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || ((((((((((((((~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33)) && ~bvule32(2bv32, E_M)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(\result, 0bv32)) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && 2bv32 == m_st) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || (((((((((((~bvule32(2bv32, E_M) && ~bvule32(__retres1, 0bv32)) && ~bvule32(\result, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && 2bv32 == m_st) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || ((((((((((~bvule32(2bv32, E_M) && ~bvule32(__retres1, 0bv32)) && ~bvule32(\result, 0bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && 2bv32 == m_st) && 1bv32 == t1_i) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || ((((((((((((((((~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33)) && ~bvule32(2bv32, E_M)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(\result, 0bv32)) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && local == token) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || ((((((((((((((((~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33)) && ~bvule32(2bv32, E_M)) && ~bvule32(__retres1, 0bv32)) && ~bvule34(~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)), ~bvadd16(~zero_extendFrom32To34(token), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)[32:32] ++ 0bv32)))) && ~bvule32(\result, 0bv32)) && ~bvult64(~bvadd16(~zero_extendFrom32To34(token), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)[32:32] ++ 0bv32)), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 2bv33)))) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) RESULT: Ultimate proved your program to be correct! [2022-01-11 00:17:01,285 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...