/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.trace.refinement.strategy CAMEL_NO_AM -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/systemc/token_ring.01.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-79ed534 [2020-07-19 21:49:22,260 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-19 21:49:22,263 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-19 21:49:22,281 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-19 21:49:22,282 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-19 21:49:22,284 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-19 21:49:22,285 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-19 21:49:22,296 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-19 21:49:22,298 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-19 21:49:22,304 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-19 21:49:22,305 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-19 21:49:22,306 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-19 21:49:22,306 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-19 21:49:22,307 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-19 21:49:22,310 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-19 21:49:22,311 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-19 21:49:22,313 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-19 21:49:22,315 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-19 21:49:22,318 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-19 21:49:22,324 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-19 21:49:22,328 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-19 21:49:22,329 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-19 21:49:22,332 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-19 21:49:22,333 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-19 21:49:22,336 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-19 21:49:22,336 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-19 21:49:22,336 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-19 21:49:22,338 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-19 21:49:22,339 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-19 21:49:22,340 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-19 21:49:22,340 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-19 21:49:22,341 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-19 21:49:22,342 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-19 21:49:22,343 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-19 21:49:22,345 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-19 21:49:22,345 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-19 21:49:22,346 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-19 21:49:22,346 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-19 21:49:22,346 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-19 21:49:22,347 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-19 21:49:22,348 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-19 21:49:22,349 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-19 21:49:22,385 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-19 21:49:22,386 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-19 21:49:22,390 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-19 21:49:22,390 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-19 21:49:22,390 INFO L138 SettingsManager]: * Use SBE=true [2020-07-19 21:49:22,391 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-19 21:49:22,391 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-19 21:49:22,391 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-19 21:49:22,391 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-19 21:49:22,391 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-19 21:49:22,392 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-19 21:49:22,392 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-19 21:49:22,392 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-19 21:49:22,396 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-19 21:49:22,396 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-19 21:49:22,396 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-19 21:49:22,397 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-19 21:49:22,397 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-19 21:49:22,397 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-19 21:49:22,397 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-19 21:49:22,397 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-19 21:49:22,398 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-19 21:49:22,398 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-19 21:49:22,398 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-19 21:49:22,398 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-19 21:49:22,398 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-19 21:49:22,399 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-19 21:49:22,399 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-19 21:49:22,399 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-19 21:49:22,400 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> CAMEL_NO_AM [2020-07-19 21:49:22,689 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-19 21:49:22,702 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-19 21:49:22,705 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-19 21:49:22,707 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-19 21:49:22,707 INFO L275 PluginConnector]: CDTParser initialized [2020-07-19 21:49:22,708 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/token_ring.01.cil-1.c [2020-07-19 21:49:22,770 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c834dccd/f1e778da9c9a4ee6905d766aadbf507c/FLAGe62a411bd [2020-07-19 21:49:23,220 INFO L306 CDTParser]: Found 1 translation units. [2020-07-19 21:49:23,221 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/token_ring.01.cil-1.c [2020-07-19 21:49:23,230 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c834dccd/f1e778da9c9a4ee6905d766aadbf507c/FLAGe62a411bd [2020-07-19 21:49:23,625 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c834dccd/f1e778da9c9a4ee6905d766aadbf507c [2020-07-19 21:49:23,633 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-19 21:49:23,635 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-19 21:49:23,636 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-19 21:49:23,636 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-19 21:49:23,640 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-19 21:49:23,641 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 09:49:23" (1/1) ... [2020-07-19 21:49:23,644 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@98434ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:49:23, skipping insertion in model container [2020-07-19 21:49:23,644 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 09:49:23" (1/1) ... [2020-07-19 21:49:23,651 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-19 21:49:23,701 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-19 21:49:23,922 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-19 21:49:23,929 INFO L203 MainTranslator]: Completed pre-run [2020-07-19 21:49:24,084 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-19 21:49:24,115 INFO L208 MainTranslator]: Completed translation [2020-07-19 21:49:24,116 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:49:24 WrapperNode [2020-07-19 21:49:24,117 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-19 21:49:24,118 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-19 21:49:24,118 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-19 21:49:24,118 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-19 21:49:24,128 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:49:24" (1/1) ... [2020-07-19 21:49:24,128 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:49:24" (1/1) ... [2020-07-19 21:49:24,136 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:49:24" (1/1) ... [2020-07-19 21:49:24,136 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:49:24" (1/1) ... [2020-07-19 21:49:24,145 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:49:24" (1/1) ... [2020-07-19 21:49:24,155 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:49:24" (1/1) ... [2020-07-19 21:49:24,157 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:49:24" (1/1) ... [2020-07-19 21:49:24,160 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-19 21:49:24,161 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-19 21:49:24,161 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-19 21:49:24,161 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-19 21:49:24,162 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:49:24" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-19 21:49:24,219 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-19 21:49:24,220 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-19 21:49:24,220 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2020-07-19 21:49:24,220 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2020-07-19 21:49:24,220 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2020-07-19 21:49:24,220 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2020-07-19 21:49:24,221 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2020-07-19 21:49:24,221 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2020-07-19 21:49:24,221 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2020-07-19 21:49:24,221 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2020-07-19 21:49:24,221 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2020-07-19 21:49:24,221 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2020-07-19 21:49:24,222 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2020-07-19 21:49:24,222 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2020-07-19 21:49:24,222 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2020-07-19 21:49:24,222 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2020-07-19 21:49:24,222 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2020-07-19 21:49:24,227 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2020-07-19 21:49:24,227 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2020-07-19 21:49:24,228 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2020-07-19 21:49:24,228 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-19 21:49:24,229 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-19 21:49:24,229 INFO L130 BoogieDeclarations]: Found specification of procedure error [2020-07-19 21:49:24,229 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2020-07-19 21:49:24,231 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2020-07-19 21:49:24,231 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2020-07-19 21:49:24,231 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-19 21:49:24,231 INFO L130 BoogieDeclarations]: Found specification of procedure master [2020-07-19 21:49:24,231 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2020-07-19 21:49:24,231 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2020-07-19 21:49:24,231 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2020-07-19 21:49:24,232 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2020-07-19 21:49:24,232 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2020-07-19 21:49:24,232 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2020-07-19 21:49:24,232 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2020-07-19 21:49:24,232 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2020-07-19 21:49:24,232 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2020-07-19 21:49:24,232 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2020-07-19 21:49:24,232 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2020-07-19 21:49:24,233 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2020-07-19 21:49:24,233 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2020-07-19 21:49:24,233 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-19 21:49:24,233 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-19 21:49:24,233 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-19 21:49:24,711 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-19 21:49:24,712 INFO L295 CfgBuilder]: Removed 4 assume(true) statements. [2020-07-19 21:49:24,718 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 09:49:24 BoogieIcfgContainer [2020-07-19 21:49:24,718 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-19 21:49:24,722 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-19 21:49:24,722 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-19 21:49:24,725 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-19 21:49:24,726 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.07 09:49:23" (1/3) ... [2020-07-19 21:49:24,727 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23ebe41f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 09:49:24, skipping insertion in model container [2020-07-19 21:49:24,727 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:49:24" (2/3) ... [2020-07-19 21:49:24,727 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23ebe41f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 09:49:24, skipping insertion in model container [2020-07-19 21:49:24,728 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 09:49:24" (3/3) ... [2020-07-19 21:49:24,729 INFO L109 eAbstractionObserver]: Analyzing ICFG token_ring.01.cil-1.c [2020-07-19 21:49:24,740 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-19 21:49:24,748 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-19 21:49:24,763 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-19 21:49:24,790 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-19 21:49:24,790 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-19 21:49:24,790 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-19 21:49:24,791 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-19 21:49:24,791 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-19 21:49:24,791 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-19 21:49:24,791 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-19 21:49:24,792 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-19 21:49:24,816 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states. [2020-07-19 21:49:24,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-07-19 21:49:24,827 INFO L414 BasicCegarLoop]: Found error trace [2020-07-19 21:49:24,828 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-19 21:49:24,828 INFO L427 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-19 21:49:24,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-19 21:49:24,835 INFO L82 PathProgramCache]: Analyzing trace with hash 205618956, now seen corresponding path program 1 times [2020-07-19 21:49:24,844 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2020-07-19 21:49:24,844 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639640263] [2020-07-19 21:49:24,845 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@7b7dbefc [2020-07-19 21:49:25,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:25,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:25,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:25,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:25,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:25,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:25,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:25,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:25,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:25,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:25,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:25,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-19 21:49:25,380 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639640263] [2020-07-19 21:49:25,381 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-19 21:49:25,381 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-07-19 21:49:25,382 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103571206] [2020-07-19 21:49:25,388 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-19 21:49:25,388 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2020-07-19 21:49:25,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-19 21:49:25,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-07-19 21:49:25,408 INFO L87 Difference]: Start difference. First operand 144 states. Second operand 9 states. [2020-07-19 21:49:27,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-19 21:49:27,555 INFO L93 Difference]: Finished difference Result 501 states and 755 transitions. [2020-07-19 21:49:27,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-07-19 21:49:27,557 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 77 [2020-07-19 21:49:27,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-19 21:49:27,578 INFO L225 Difference]: With dead ends: 501 [2020-07-19 21:49:27,578 INFO L226 Difference]: Without dead ends: 357 [2020-07-19 21:49:27,586 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2020-07-19 21:49:27,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2020-07-19 21:49:27,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 244. [2020-07-19 21:49:27,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2020-07-19 21:49:27,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 323 transitions. [2020-07-19 21:49:27,679 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 323 transitions. Word has length 77 [2020-07-19 21:49:27,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-19 21:49:27,680 INFO L479 AbstractCegarLoop]: Abstraction has 244 states and 323 transitions. [2020-07-19 21:49:27,680 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-19 21:49:27,680 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 323 transitions. [2020-07-19 21:49:27,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-07-19 21:49:27,684 INFO L414 BasicCegarLoop]: Found error trace [2020-07-19 21:49:27,684 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-19 21:49:27,685 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-19 21:49:27,685 INFO L427 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-19 21:49:27,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-19 21:49:27,686 INFO L82 PathProgramCache]: Analyzing trace with hash -2125445556, now seen corresponding path program 1 times [2020-07-19 21:49:27,686 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2020-07-19 21:49:27,686 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053335866] [2020-07-19 21:49:27,686 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@7b7dbefc [2020-07-19 21:49:27,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:27,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:27,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:27,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:27,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:27,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:27,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:27,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:27,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:27,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:27,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:27,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-19 21:49:27,883 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053335866] [2020-07-19 21:49:27,884 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-19 21:49:27,884 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-07-19 21:49:27,884 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367876072] [2020-07-19 21:49:27,886 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-19 21:49:27,886 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2020-07-19 21:49:27,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-19 21:49:27,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-07-19 21:49:27,887 INFO L87 Difference]: Start difference. First operand 244 states and 323 transitions. Second operand 10 states. [2020-07-19 21:49:29,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-19 21:49:29,006 INFO L93 Difference]: Finished difference Result 573 states and 802 transitions. [2020-07-19 21:49:29,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-19 21:49:29,008 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 77 [2020-07-19 21:49:29,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-19 21:49:29,018 INFO L225 Difference]: With dead ends: 573 [2020-07-19 21:49:29,018 INFO L226 Difference]: Without dead ends: 348 [2020-07-19 21:49:29,024 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2020-07-19 21:49:29,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2020-07-19 21:49:29,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 244. [2020-07-19 21:49:29,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2020-07-19 21:49:29,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 316 transitions. [2020-07-19 21:49:29,105 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 316 transitions. Word has length 77 [2020-07-19 21:49:29,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-19 21:49:29,105 INFO L479 AbstractCegarLoop]: Abstraction has 244 states and 316 transitions. [2020-07-19 21:49:29,105 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-19 21:49:29,105 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 316 transitions. [2020-07-19 21:49:29,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-07-19 21:49:29,115 INFO L414 BasicCegarLoop]: Found error trace [2020-07-19 21:49:29,115 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-19 21:49:29,115 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-19 21:49:29,116 INFO L427 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-19 21:49:29,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-19 21:49:29,116 INFO L82 PathProgramCache]: Analyzing trace with hash -676620532, now seen corresponding path program 1 times [2020-07-19 21:49:29,118 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2020-07-19 21:49:29,118 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725567853] [2020-07-19 21:49:29,118 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@7b7dbefc [2020-07-19 21:49:29,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:29,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:29,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:29,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:29,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:29,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:29,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:29,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:29,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:29,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:29,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:29,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-19 21:49:29,289 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725567853] [2020-07-19 21:49:29,289 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-19 21:49:29,289 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-07-19 21:49:29,289 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434940178] [2020-07-19 21:49:29,290 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-19 21:49:29,290 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2020-07-19 21:49:29,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-19 21:49:29,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-07-19 21:49:29,291 INFO L87 Difference]: Start difference. First operand 244 states and 316 transitions. Second operand 10 states. [2020-07-19 21:49:30,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-19 21:49:30,905 INFO L93 Difference]: Finished difference Result 696 states and 1012 transitions. [2020-07-19 21:49:30,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-07-19 21:49:30,906 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 77 [2020-07-19 21:49:30,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-19 21:49:30,911 INFO L225 Difference]: With dead ends: 696 [2020-07-19 21:49:30,911 INFO L226 Difference]: Without dead ends: 471 [2020-07-19 21:49:30,914 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=268, Unknown=0, NotChecked=0, Total=380 [2020-07-19 21:49:30,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2020-07-19 21:49:30,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 296. [2020-07-19 21:49:30,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2020-07-19 21:49:30,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 369 transitions. [2020-07-19 21:49:30,961 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 369 transitions. Word has length 77 [2020-07-19 21:49:30,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-19 21:49:30,961 INFO L479 AbstractCegarLoop]: Abstraction has 296 states and 369 transitions. [2020-07-19 21:49:30,961 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-19 21:49:30,962 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 369 transitions. [2020-07-19 21:49:30,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-07-19 21:49:30,963 INFO L414 BasicCegarLoop]: Found error trace [2020-07-19 21:49:30,963 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-19 21:49:30,963 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-19 21:49:30,964 INFO L427 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-19 21:49:30,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-19 21:49:30,964 INFO L82 PathProgramCache]: Analyzing trace with hash 758526605, now seen corresponding path program 1 times [2020-07-19 21:49:30,964 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2020-07-19 21:49:30,965 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64952565] [2020-07-19 21:49:30,965 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@7b7dbefc [2020-07-19 21:49:30,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:31,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:31,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:31,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:31,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:31,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:31,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:31,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:31,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:31,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:31,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:31,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-19 21:49:31,168 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64952565] [2020-07-19 21:49:31,168 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-19 21:49:31,169 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-07-19 21:49:31,169 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115681604] [2020-07-19 21:49:31,169 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-19 21:49:31,170 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2020-07-19 21:49:31,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-19 21:49:31,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-07-19 21:49:31,171 INFO L87 Difference]: Start difference. First operand 296 states and 369 transitions. Second operand 10 states. [2020-07-19 21:49:32,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-19 21:49:32,567 INFO L93 Difference]: Finished difference Result 718 states and 955 transitions. [2020-07-19 21:49:32,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-19 21:49:32,573 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 77 [2020-07-19 21:49:32,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-19 21:49:32,578 INFO L225 Difference]: With dead ends: 718 [2020-07-19 21:49:32,579 INFO L226 Difference]: Without dead ends: 442 [2020-07-19 21:49:32,581 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2020-07-19 21:49:32,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2020-07-19 21:49:32,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 316. [2020-07-19 21:49:32,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316 states. [2020-07-19 21:49:32,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 389 transitions. [2020-07-19 21:49:32,622 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 389 transitions. Word has length 77 [2020-07-19 21:49:32,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-19 21:49:32,622 INFO L479 AbstractCegarLoop]: Abstraction has 316 states and 389 transitions. [2020-07-19 21:49:32,622 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-19 21:49:32,623 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 389 transitions. [2020-07-19 21:49:32,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-07-19 21:49:32,625 INFO L414 BasicCegarLoop]: Found error trace [2020-07-19 21:49:32,625 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-19 21:49:32,626 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-19 21:49:32,626 INFO L427 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-19 21:49:32,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-19 21:49:32,629 INFO L82 PathProgramCache]: Analyzing trace with hash -613280693, now seen corresponding path program 1 times [2020-07-19 21:49:32,630 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2020-07-19 21:49:32,630 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816675702] [2020-07-19 21:49:32,630 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@7b7dbefc [2020-07-19 21:49:32,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:32,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:32,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:32,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:32,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:32,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:32,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:32,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:32,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:32,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:32,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:32,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-19 21:49:32,869 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816675702] [2020-07-19 21:49:32,869 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-19 21:49:32,870 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-07-19 21:49:32,870 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705514519] [2020-07-19 21:49:32,870 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-19 21:49:32,871 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2020-07-19 21:49:32,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-19 21:49:32,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-07-19 21:49:32,871 INFO L87 Difference]: Start difference. First operand 316 states and 389 transitions. Second operand 10 states. [2020-07-19 21:49:34,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-19 21:49:34,144 INFO L93 Difference]: Finished difference Result 748 states and 981 transitions. [2020-07-19 21:49:34,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-19 21:49:34,145 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 77 [2020-07-19 21:49:34,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-19 21:49:34,149 INFO L225 Difference]: With dead ends: 748 [2020-07-19 21:49:34,149 INFO L226 Difference]: Without dead ends: 452 [2020-07-19 21:49:34,151 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2020-07-19 21:49:34,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2020-07-19 21:49:34,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 326. [2020-07-19 21:49:34,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 326 states. [2020-07-19 21:49:34,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 397 transitions. [2020-07-19 21:49:34,189 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 397 transitions. Word has length 77 [2020-07-19 21:49:34,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-19 21:49:34,189 INFO L479 AbstractCegarLoop]: Abstraction has 326 states and 397 transitions. [2020-07-19 21:49:34,189 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-19 21:49:34,189 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 397 transitions. [2020-07-19 21:49:34,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-07-19 21:49:34,192 INFO L414 BasicCegarLoop]: Found error trace [2020-07-19 21:49:34,192 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-19 21:49:34,192 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-19 21:49:34,192 INFO L427 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-19 21:49:34,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-19 21:49:34,193 INFO L82 PathProgramCache]: Analyzing trace with hash 88319181, now seen corresponding path program 1 times [2020-07-19 21:49:34,193 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2020-07-19 21:49:34,193 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347644545] [2020-07-19 21:49:34,193 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@7b7dbefc [2020-07-19 21:49:34,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:34,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:34,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:34,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:34,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:34,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:34,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:34,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:34,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:34,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:34,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:34,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-19 21:49:34,408 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347644545] [2020-07-19 21:49:34,409 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-19 21:49:34,409 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-07-19 21:49:34,409 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816095906] [2020-07-19 21:49:34,410 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-19 21:49:34,410 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2020-07-19 21:49:34,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-19 21:49:34,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-07-19 21:49:34,411 INFO L87 Difference]: Start difference. First operand 326 states and 397 transitions. Second operand 10 states. [2020-07-19 21:49:35,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-19 21:49:35,910 INFO L93 Difference]: Finished difference Result 894 states and 1170 transitions. [2020-07-19 21:49:35,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-07-19 21:49:35,911 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 77 [2020-07-19 21:49:35,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-19 21:49:35,918 INFO L225 Difference]: With dead ends: 894 [2020-07-19 21:49:35,918 INFO L226 Difference]: Without dead ends: 587 [2020-07-19 21:49:35,920 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=127, Invalid=335, Unknown=0, NotChecked=0, Total=462 [2020-07-19 21:49:35,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2020-07-19 21:49:35,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 362. [2020-07-19 21:49:35,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 362 states. [2020-07-19 21:49:35,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 422 transitions. [2020-07-19 21:49:35,958 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 422 transitions. Word has length 77 [2020-07-19 21:49:35,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-19 21:49:35,959 INFO L479 AbstractCegarLoop]: Abstraction has 362 states and 422 transitions. [2020-07-19 21:49:35,959 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-19 21:49:35,960 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 422 transitions. [2020-07-19 21:49:35,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-07-19 21:49:35,961 INFO L414 BasicCegarLoop]: Found error trace [2020-07-19 21:49:35,961 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-19 21:49:35,961 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-19 21:49:35,961 INFO L427 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-19 21:49:35,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-19 21:49:35,962 INFO L82 PathProgramCache]: Analyzing trace with hash 228867791, now seen corresponding path program 1 times [2020-07-19 21:49:35,962 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2020-07-19 21:49:35,962 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699046990] [2020-07-19 21:49:35,962 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@7b7dbefc [2020-07-19 21:49:35,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:36,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:36,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:36,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:36,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:36,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:36,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:36,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:36,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:36,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:36,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:36,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-19 21:49:36,084 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699046990] [2020-07-19 21:49:36,085 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-19 21:49:36,085 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-19 21:49:36,085 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359467351] [2020-07-19 21:49:36,089 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-19 21:49:36,089 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2020-07-19 21:49:36,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-19 21:49:36,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-07-19 21:49:36,090 INFO L87 Difference]: Start difference. First operand 362 states and 422 transitions. Second operand 7 states. [2020-07-19 21:49:37,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-19 21:49:37,432 INFO L93 Difference]: Finished difference Result 1180 states and 1487 transitions. [2020-07-19 21:49:37,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-19 21:49:37,433 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 77 [2020-07-19 21:49:37,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-19 21:49:37,442 INFO L225 Difference]: With dead ends: 1180 [2020-07-19 21:49:37,442 INFO L226 Difference]: Without dead ends: 838 [2020-07-19 21:49:37,444 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2020-07-19 21:49:37,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2020-07-19 21:49:37,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 736. [2020-07-19 21:49:37,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 736 states. [2020-07-19 21:49:37,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 736 states and 896 transitions. [2020-07-19 21:49:37,542 INFO L78 Accepts]: Start accepts. Automaton has 736 states and 896 transitions. Word has length 77 [2020-07-19 21:49:37,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-19 21:49:37,543 INFO L479 AbstractCegarLoop]: Abstraction has 736 states and 896 transitions. [2020-07-19 21:49:37,544 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-19 21:49:37,544 INFO L276 IsEmpty]: Start isEmpty. Operand 736 states and 896 transitions. [2020-07-19 21:49:37,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2020-07-19 21:49:37,546 INFO L414 BasicCegarLoop]: Found error trace [2020-07-19 21:49:37,547 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-19 21:49:37,547 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-19 21:49:37,547 INFO L427 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-19 21:49:37,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-19 21:49:37,548 INFO L82 PathProgramCache]: Analyzing trace with hash -208124888, now seen corresponding path program 1 times [2020-07-19 21:49:37,548 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2020-07-19 21:49:37,549 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742536619] [2020-07-19 21:49:37,549 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@7b7dbefc [2020-07-19 21:49:37,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:37,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:37,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:37,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:37,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:37,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:37,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:37,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:37,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:37,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:37,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:37,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:37,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:37,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:37,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:37,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:37,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:37,834 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-07-19 21:49:37,834 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742536619] [2020-07-19 21:49:37,835 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [428514038] [2020-07-19 21:49:37,835 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@7b7dbefc No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-19 21:49:37,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:37,952 INFO L263 TraceCheckSpWp]: Trace formula consists of 537 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-19 21:49:37,965 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-19 21:49:38,002 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-07-19 21:49:38,002 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-19 21:49:38,002 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2020-07-19 21:49:38,003 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727508806] [2020-07-19 21:49:38,003 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-19 21:49:38,003 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2020-07-19 21:49:38,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-19 21:49:38,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2020-07-19 21:49:38,004 INFO L87 Difference]: Start difference. First operand 736 states and 896 transitions. Second operand 3 states. [2020-07-19 21:49:38,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-19 21:49:38,194 INFO L93 Difference]: Finished difference Result 2007 states and 2500 transitions. [2020-07-19 21:49:38,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-19 21:49:38,194 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2020-07-19 21:49:38,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-19 21:49:38,203 INFO L225 Difference]: With dead ends: 2007 [2020-07-19 21:49:38,203 INFO L226 Difference]: Without dead ends: 1018 [2020-07-19 21:49:38,207 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 152 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2020-07-19 21:49:38,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1018 states. [2020-07-19 21:49:38,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1018 to 1018. [2020-07-19 21:49:38,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1018 states. [2020-07-19 21:49:38,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1018 states to 1018 states and 1236 transitions. [2020-07-19 21:49:38,312 INFO L78 Accepts]: Start accepts. Automaton has 1018 states and 1236 transitions. Word has length 121 [2020-07-19 21:49:38,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-19 21:49:38,313 INFO L479 AbstractCegarLoop]: Abstraction has 1018 states and 1236 transitions. [2020-07-19 21:49:38,314 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-19 21:49:38,314 INFO L276 IsEmpty]: Start isEmpty. Operand 1018 states and 1236 transitions. [2020-07-19 21:49:38,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2020-07-19 21:49:38,318 INFO L414 BasicCegarLoop]: Found error trace [2020-07-19 21:49:38,319 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-19 21:49:38,533 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2020-07-19 21:49:38,534 INFO L427 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-19 21:49:38,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-19 21:49:38,535 INFO L82 PathProgramCache]: Analyzing trace with hash -1360925018, now seen corresponding path program 1 times [2020-07-19 21:49:38,535 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2020-07-19 21:49:38,536 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158335024] [2020-07-19 21:49:38,536 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@7b7dbefc [2020-07-19 21:49:38,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:38,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:38,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:38,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:38,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:38,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:38,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:38,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:38,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:38,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:38,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:38,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:38,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:38,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:38,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:38,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:38,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:38,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:38,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:38,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:38,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:38,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:38,889 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 8 proven. 24 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2020-07-19 21:49:38,891 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158335024] [2020-07-19 21:49:38,891 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1326709414] [2020-07-19 21:49:38,891 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@7b7dbefc No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-19 21:49:39,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:39,022 INFO L263 TraceCheckSpWp]: Trace formula consists of 645 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-19 21:49:39,037 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-19 21:49:39,070 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-07-19 21:49:39,070 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-19 21:49:39,071 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 10 [2020-07-19 21:49:39,071 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565572193] [2020-07-19 21:49:39,072 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-19 21:49:39,072 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2020-07-19 21:49:39,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-19 21:49:39,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-07-19 21:49:39,073 INFO L87 Difference]: Start difference. First operand 1018 states and 1236 transitions. Second operand 3 states. [2020-07-19 21:49:39,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-19 21:49:39,229 INFO L93 Difference]: Finished difference Result 2446 states and 3135 transitions. [2020-07-19 21:49:39,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-19 21:49:39,230 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 156 [2020-07-19 21:49:39,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-19 21:49:39,240 INFO L225 Difference]: With dead ends: 2446 [2020-07-19 21:49:39,240 INFO L226 Difference]: Without dead ends: 1449 [2020-07-19 21:49:39,246 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-07-19 21:49:39,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1449 states. [2020-07-19 21:49:39,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1449 to 1443. [2020-07-19 21:49:39,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1443 states. [2020-07-19 21:49:39,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1443 states to 1443 states and 1735 transitions. [2020-07-19 21:49:39,413 INFO L78 Accepts]: Start accepts. Automaton has 1443 states and 1735 transitions. Word has length 156 [2020-07-19 21:49:39,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-19 21:49:39,415 INFO L479 AbstractCegarLoop]: Abstraction has 1443 states and 1735 transitions. [2020-07-19 21:49:39,415 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-19 21:49:39,415 INFO L276 IsEmpty]: Start isEmpty. Operand 1443 states and 1735 transitions. [2020-07-19 21:49:39,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2020-07-19 21:49:39,423 INFO L414 BasicCegarLoop]: Found error trace [2020-07-19 21:49:39,424 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-19 21:49:39,638 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-19 21:49:39,639 INFO L427 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-19 21:49:39,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-19 21:49:39,640 INFO L82 PathProgramCache]: Analyzing trace with hash 1238354593, now seen corresponding path program 1 times [2020-07-19 21:49:39,641 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2020-07-19 21:49:39,641 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774487944] [2020-07-19 21:49:39,641 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@7b7dbefc [2020-07-19 21:49:39,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:39,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:39,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:39,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:39,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:39,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:39,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:39,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:39,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:39,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:39,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:39,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:39,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:39,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:39,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:39,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:39,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:39,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:39,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:39,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:39,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:39,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:39,964 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 8 proven. 18 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2020-07-19 21:49:39,964 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774487944] [2020-07-19 21:49:39,965 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [395183711] [2020-07-19 21:49:39,965 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@7b7dbefc No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-19 21:49:40,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:40,076 INFO L263 TraceCheckSpWp]: Trace formula consists of 643 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-19 21:49:40,099 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-19 21:49:40,247 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 13 proven. 43 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-07-19 21:49:40,248 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-19 21:49:40,248 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 5] total 14 [2020-07-19 21:49:40,249 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961039213] [2020-07-19 21:49:40,250 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-07-19 21:49:40,250 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2020-07-19 21:49:40,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-07-19 21:49:40,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2020-07-19 21:49:40,251 INFO L87 Difference]: Start difference. First operand 1443 states and 1735 transitions. Second operand 14 states. [2020-07-19 21:49:42,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-19 21:49:42,718 INFO L93 Difference]: Finished difference Result 2733 states and 3367 transitions. [2020-07-19 21:49:42,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-07-19 21:49:42,719 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 157 [2020-07-19 21:49:42,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-19 21:49:42,732 INFO L225 Difference]: With dead ends: 2733 [2020-07-19 21:49:42,733 INFO L226 Difference]: Without dead ends: 1765 [2020-07-19 21:49:42,740 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=189, Invalid=567, Unknown=0, NotChecked=0, Total=756 [2020-07-19 21:49:42,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1765 states. [2020-07-19 21:49:42,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1765 to 1598. [2020-07-19 21:49:42,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1598 states. [2020-07-19 21:49:42,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1598 states to 1598 states and 1910 transitions. [2020-07-19 21:49:42,954 INFO L78 Accepts]: Start accepts. Automaton has 1598 states and 1910 transitions. Word has length 157 [2020-07-19 21:49:42,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-19 21:49:42,954 INFO L479 AbstractCegarLoop]: Abstraction has 1598 states and 1910 transitions. [2020-07-19 21:49:42,955 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-07-19 21:49:42,955 INFO L276 IsEmpty]: Start isEmpty. Operand 1598 states and 1910 transitions. [2020-07-19 21:49:42,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2020-07-19 21:49:42,961 INFO L414 BasicCegarLoop]: Found error trace [2020-07-19 21:49:42,962 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-19 21:49:43,174 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2020-07-19 21:49:43,175 INFO L427 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-19 21:49:43,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-19 21:49:43,176 INFO L82 PathProgramCache]: Analyzing trace with hash 846884099, now seen corresponding path program 1 times [2020-07-19 21:49:43,176 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2020-07-19 21:49:43,176 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851963861] [2020-07-19 21:49:43,177 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@7b7dbefc [2020-07-19 21:49:43,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:43,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:43,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:43,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:43,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:43,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:43,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:43,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:43,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:43,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:43,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:43,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:43,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:43,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:43,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:43,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:43,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:43,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:43,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:43,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:43,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:43,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:43,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:43,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:43,403 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2020-07-19 21:49:43,404 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851963861] [2020-07-19 21:49:43,404 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1842061074] [2020-07-19 21:49:43,404 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@7b7dbefc No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-19 21:49:43,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:43,557 INFO L263 TraceCheckSpWp]: Trace formula consists of 706 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-19 21:49:43,567 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-19 21:49:43,615 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2020-07-19 21:49:43,616 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-19 21:49:43,616 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 9 [2020-07-19 21:49:43,617 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970954606] [2020-07-19 21:49:43,617 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-19 21:49:43,618 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2020-07-19 21:49:43,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-19 21:49:43,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-07-19 21:49:43,618 INFO L87 Difference]: Start difference. First operand 1598 states and 1910 transitions. Second operand 3 states. [2020-07-19 21:49:43,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-19 21:49:43,811 INFO L93 Difference]: Finished difference Result 3165 states and 3848 transitions. [2020-07-19 21:49:43,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-19 21:49:43,812 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 175 [2020-07-19 21:49:43,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-19 21:49:43,873 INFO L225 Difference]: With dead ends: 3165 [2020-07-19 21:49:43,873 INFO L226 Difference]: Without dead ends: 1588 [2020-07-19 21:49:43,879 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 217 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-07-19 21:49:43,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1588 states. [2020-07-19 21:49:44,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1588 to 1588. [2020-07-19 21:49:44,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1588 states. [2020-07-19 21:49:44,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1588 states to 1588 states and 1864 transitions. [2020-07-19 21:49:44,040 INFO L78 Accepts]: Start accepts. Automaton has 1588 states and 1864 transitions. Word has length 175 [2020-07-19 21:49:44,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-19 21:49:44,041 INFO L479 AbstractCegarLoop]: Abstraction has 1588 states and 1864 transitions. [2020-07-19 21:49:44,041 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-19 21:49:44,041 INFO L276 IsEmpty]: Start isEmpty. Operand 1588 states and 1864 transitions. [2020-07-19 21:49:44,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2020-07-19 21:49:44,044 INFO L414 BasicCegarLoop]: Found error trace [2020-07-19 21:49:44,045 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-19 21:49:44,259 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-19 21:49:44,260 INFO L427 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-19 21:49:44,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-19 21:49:44,260 INFO L82 PathProgramCache]: Analyzing trace with hash -797989467, now seen corresponding path program 1 times [2020-07-19 21:49:44,260 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2020-07-19 21:49:44,261 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121238703] [2020-07-19 21:49:44,261 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@7b7dbefc [2020-07-19 21:49:44,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:44,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:44,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:44,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:44,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:44,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:44,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:44,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:44,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:44,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:44,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:44,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:44,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:44,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:44,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:44,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:44,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:44,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:44,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:44,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:44,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:44,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:44,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:44,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:44,522 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 21 proven. 5 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2020-07-19 21:49:44,522 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121238703] [2020-07-19 21:49:44,523 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1282150619] [2020-07-19 21:49:44,523 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@7b7dbefc No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-19 21:49:44,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:44,645 INFO L263 TraceCheckSpWp]: Trace formula consists of 703 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-19 21:49:44,649 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-19 21:49:44,688 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2020-07-19 21:49:44,688 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-19 21:49:44,689 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 10 [2020-07-19 21:49:44,691 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57598600] [2020-07-19 21:49:44,692 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-19 21:49:44,692 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2020-07-19 21:49:44,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-19 21:49:44,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-07-19 21:49:44,693 INFO L87 Difference]: Start difference. First operand 1588 states and 1864 transitions. Second operand 3 states. [2020-07-19 21:49:44,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-19 21:49:44,872 INFO L93 Difference]: Finished difference Result 3618 states and 4277 transitions. [2020-07-19 21:49:44,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-19 21:49:44,872 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 176 [2020-07-19 21:49:44,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-19 21:49:44,882 INFO L225 Difference]: With dead ends: 3618 [2020-07-19 21:49:44,883 INFO L226 Difference]: Without dead ends: 1034 [2020-07-19 21:49:44,892 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 217 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-07-19 21:49:44,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1034 states. [2020-07-19 21:49:45,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1034 to 1034. [2020-07-19 21:49:45,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1034 states. [2020-07-19 21:49:45,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1034 states to 1034 states and 1176 transitions. [2020-07-19 21:49:45,027 INFO L78 Accepts]: Start accepts. Automaton has 1034 states and 1176 transitions. Word has length 176 [2020-07-19 21:49:45,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-19 21:49:45,028 INFO L479 AbstractCegarLoop]: Abstraction has 1034 states and 1176 transitions. [2020-07-19 21:49:45,028 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-19 21:49:45,028 INFO L276 IsEmpty]: Start isEmpty. Operand 1034 states and 1176 transitions. [2020-07-19 21:49:45,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2020-07-19 21:49:45,031 INFO L414 BasicCegarLoop]: Found error trace [2020-07-19 21:49:45,031 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-19 21:49:45,246 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2020-07-19 21:49:45,247 INFO L427 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-19 21:49:45,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-19 21:49:45,248 INFO L82 PathProgramCache]: Analyzing trace with hash -421514357, now seen corresponding path program 1 times [2020-07-19 21:49:45,249 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2020-07-19 21:49:45,249 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373834392] [2020-07-19 21:49:45,250 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@7b7dbefc [2020-07-19 21:49:45,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:45,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:45,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:45,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:45,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:45,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:45,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:45,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:45,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:45,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:45,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:45,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:45,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:45,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:45,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:45,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:45,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:45,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:45,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:45,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:45,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:45,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:45,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:45,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:45,625 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 20 proven. 1 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2020-07-19 21:49:45,625 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373834392] [2020-07-19 21:49:45,625 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1438286231] [2020-07-19 21:49:45,626 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@7b7dbefc No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-19 21:49:45,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:49:45,743 INFO L263 TraceCheckSpWp]: Trace formula consists of 713 conjuncts, 17 conjunts are in the unsatisfiable core [2020-07-19 21:49:45,749 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-19 21:49:45,845 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 52 proven. 23 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2020-07-19 21:49:45,845 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-19 21:49:45,846 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6] total 12 [2020-07-19 21:49:45,846 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837294395] [2020-07-19 21:49:45,847 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-19 21:49:45,848 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2020-07-19 21:49:45,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-19 21:49:45,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2020-07-19 21:49:45,849 INFO L87 Difference]: Start difference. First operand 1034 states and 1176 transitions. Second operand 12 states. [2020-07-19 21:49:48,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-19 21:49:48,076 INFO L93 Difference]: Finished difference Result 1268 states and 1468 transitions. [2020-07-19 21:49:48,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-07-19 21:49:48,077 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 176 [2020-07-19 21:49:48,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-19 21:49:48,078 INFO L225 Difference]: With dead ends: 1268 [2020-07-19 21:49:48,078 INFO L226 Difference]: Without dead ends: 0 [2020-07-19 21:49:48,083 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 224 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=137, Invalid=463, Unknown=0, NotChecked=0, Total=600 [2020-07-19 21:49:48,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-19 21:49:48,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-19 21:49:48,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-19 21:49:48,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-19 21:49:48,084 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 176 [2020-07-19 21:49:48,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-19 21:49:48,084 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-19 21:49:48,084 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-19 21:49:48,085 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-19 21:49:48,085 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-19 21:49:48,296 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-19 21:49:48,299 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-19 21:49:48,899 WARN L193 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 95 [2020-07-19 21:49:49,032 WARN L193 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 95 [2020-07-19 21:49:49,220 WARN L193 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 95 [2020-07-19 21:49:49,348 WARN L193 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 95 [2020-07-19 21:49:49,479 WARN L193 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 95 [2020-07-19 21:50:00,180 WARN L193 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 56 [2020-07-19 21:50:01,251 WARN L193 SmtUtils]: Spent 1.01 s on a formula simplification. DAG size of input: 131 DAG size of output: 55 [2020-07-19 21:50:01,649 WARN L193 SmtUtils]: Spent 395.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 66 [2020-07-19 21:50:02,224 WARN L193 SmtUtils]: Spent 572.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 66 [2020-07-19 21:50:02,788 WARN L193 SmtUtils]: Spent 545.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 66 [2020-07-19 21:50:02,936 WARN L193 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 39 [2020-07-19 21:50:03,475 WARN L193 SmtUtils]: Spent 536.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 66 [2020-07-19 21:50:04,020 WARN L193 SmtUtils]: Spent 542.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 66 [2020-07-19 21:50:04,147 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 53 [2020-07-19 21:50:04,693 WARN L193 SmtUtils]: Spent 544.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 66 [2020-07-19 21:50:05,908 WARN L193 SmtUtils]: Spent 1.21 s on a formula simplification. DAG size of input: 164 DAG size of output: 82 [2020-07-19 21:50:06,520 WARN L193 SmtUtils]: Spent 437.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 74 [2020-07-19 21:50:07,615 WARN L193 SmtUtils]: Spent 1.09 s on a formula simplification. DAG size of input: 169 DAG size of output: 58 [2020-07-19 21:50:08,018 WARN L193 SmtUtils]: Spent 401.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 66 [2020-07-19 21:50:08,672 WARN L193 SmtUtils]: Spent 648.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 57 [2020-07-19 21:50:09,769 WARN L193 SmtUtils]: Spent 952.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 82 [2020-07-19 21:50:10,467 WARN L193 SmtUtils]: Spent 692.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 58 [2020-07-19 21:50:11,024 WARN L193 SmtUtils]: Spent 554.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 66 [2020-07-19 21:50:13,264 WARN L193 SmtUtils]: Spent 2.23 s on a formula simplification. DAG size of input: 180 DAG size of output: 98 [2020-07-19 21:50:13,528 WARN L193 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 54 [2020-07-19 21:50:14,080 WARN L193 SmtUtils]: Spent 545.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 53 [2020-07-19 21:50:14,286 WARN L193 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 56 [2020-07-19 21:50:16,528 WARN L193 SmtUtils]: Spent 2.24 s on a formula simplification. DAG size of input: 180 DAG size of output: 98 [2020-07-19 21:50:16,885 WARN L193 SmtUtils]: Spent 352.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 53 [2020-07-19 21:50:17,438 WARN L193 SmtUtils]: Spent 550.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 66 [2020-07-19 21:50:19,730 WARN L193 SmtUtils]: Spent 2.29 s on a formula simplification. DAG size of input: 180 DAG size of output: 98 [2020-07-19 21:50:19,934 WARN L193 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 59 [2020-07-19 21:50:20,230 WARN L193 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 53 [2020-07-19 21:50:20,896 WARN L193 SmtUtils]: Spent 661.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 58 [2020-07-19 21:50:21,233 WARN L193 SmtUtils]: Spent 333.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 59 [2020-07-19 21:50:21,574 WARN L193 SmtUtils]: Spent 336.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 59 [2020-07-19 21:50:21,899 WARN L193 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 56 [2020-07-19 21:50:22,754 WARN L193 SmtUtils]: Spent 850.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 76 [2020-07-19 21:50:23,087 WARN L193 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 51 [2020-07-19 21:50:23,800 WARN L193 SmtUtils]: Spent 702.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 62 [2020-07-19 21:50:24,417 WARN L193 SmtUtils]: Spent 613.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 58 [2020-07-19 21:50:24,979 WARN L193 SmtUtils]: Spent 559.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 66 [2020-07-19 21:50:25,875 WARN L193 SmtUtils]: Spent 670.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 57 [2020-07-19 21:50:26,373 WARN L193 SmtUtils]: Spent 494.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 51 [2020-07-19 21:50:26,788 WARN L193 SmtUtils]: Spent 410.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 59 [2020-07-19 21:50:27,154 WARN L193 SmtUtils]: Spent 362.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 59 [2020-07-19 21:50:27,259 WARN L193 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 53 [2020-07-19 21:50:27,528 WARN L193 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 50 [2020-07-19 21:50:27,630 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 59 [2020-07-19 21:50:28,020 WARN L193 SmtUtils]: Spent 386.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 55 [2020-07-19 21:50:28,118 INFO L268 CegarLoopResult]: For program point immediate_notifyEXIT(lines 326 336) no Hoare annotation was computed. [2020-07-19 21:50:28,119 INFO L264 CegarLoopResult]: At program point immediate_notifyENTRY(lines 326 336) the Hoare annotation is: (let ((.cse0 (not (<= 2 ~E_1~0))) (.cse6 (not (= 1 ~t1_pc~0))) (.cse5 (not (<= 2 |old(~m_st~0)|))) (.cse1 (and (= ~m_st~0 |old(~m_st~0)|) (= |old(~t1_st~0)| ~t1_st~0))) (.cse7 (not (<= 2 ~E_M~0))) (.cse2 (= 0 ~M_E~0)) (.cse3 (not (<= 2 ~T1_E~0))) (.cse4 (= 1 ~m_pc~0)) (.cse8 (= 0 ~E_1~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (or .cse1 .cse6 (not (<= ~token~0 ~local~0)) .cse7 (not (<= 2 |old(~t1_st~0)|)) .cse2 .cse3 .cse8 (not (<= ~local~0 ~token~0))) (let ((.cse9 (+ ~local~0 1))) (or .cse0 .cse1 .cse6 .cse2 .cse3 (not (<= .cse9 ~token~0)) .cse5 (not (<= ~token~0 .cse9)))) (or .cse1 .cse7 .cse2 .cse3 (not (<= ~t1_pc~0 0)) .cse4 .cse8))) [2020-07-19 21:50:28,119 INFO L268 CegarLoopResult]: For program point immediate_notifyFINAL(lines 326 336) no Hoare annotation was computed. [2020-07-19 21:50:28,120 INFO L264 CegarLoopResult]: At program point L89-1(lines 77 108) the Hoare annotation is: (let ((.cse17 (= 1 ~m_pc~0))) (let ((.cse2 (not .cse17)) (.cse9 (= ~m_st~0 |old(~m_st~0)|)) (.cse10 (= |old(~t1_st~0)| ~t1_st~0)) (.cse5 (<= 2 ~E_M~0))) (let ((.cse16 (and .cse2 .cse9 .cse10 .cse5)) (.cse11 (not (<= 2 |old(~m_st~0)|))) (.cse0 (not (<= 2 ~E_1~0))) (.cse1 (not (<= 2 |old(~E_M~0)|))) (.cse13 (not (<= |old(~t1_pc~0)| 0))) (.cse14 (= |old(~t1_pc~0)| ~t1_pc~0)) (.cse15 (= ~E_M~0 |old(~E_M~0)|)) (.cse6 (not (<= ~local~0 |old(~token~0)|))) (.cse7 (= 0 ~M_E~0)) (.cse8 (not (<= 2 ~T1_E~0))) (.cse12 (not (<= |old(~token~0)| ~local~0)))) (and (let ((.cse4 (= 1 ~t1_pc~0))) (or .cse0 .cse1 .cse2 (let ((.cse3 (+ ~local~0 1))) (and (= 0 ~m_st~0) (<= ~token~0 .cse3) (<= .cse3 ~token~0) .cse4 .cse5)) .cse6 .cse7 .cse8 (and .cse9 .cse10 .cse4 .cse5) .cse11 (not (= 1 |old(~t1_pc~0)|)) .cse12)) (or .cse0 .cse1 .cse13 (and .cse14 .cse9 .cse10 .cse15 (= |old(~token~0)| ~token~0)) .cse16 .cse7 .cse8 .cse11) (or .cse0 .cse1 .cse16 .cse7 .cse8 .cse17 .cse11) (or .cse0 .cse1 .cse13 (not (= 0 |old(~m_st~0)|)) (and .cse14 .cse9 .cse10 (<= ~token~0 ~local~0) .cse15 (<= ~local~0 ~token~0)) .cse6 .cse7 .cse8 .cse17 .cse12))))) [2020-07-19 21:50:28,120 INFO L268 CegarLoopResult]: For program point L81(lines 81 85) no Hoare annotation was computed. [2020-07-19 21:50:28,121 INFO L264 CegarLoopResult]: At program point transmit1ENTRY(lines 74 109) the Hoare annotation is: (let ((.cse8 (= |old(~t1_pc~0)| ~t1_pc~0)) (.cse9 (= ~m_st~0 |old(~m_st~0)|)) (.cse10 (= |old(~t1_st~0)| ~t1_st~0)) (.cse12 (= ~E_M~0 |old(~E_M~0)|))) (let ((.cse2 (and .cse8 .cse9 .cse10 .cse12 (= |old(~token~0)| ~token~0))) (.cse7 (not (<= |old(~t1_pc~0)| 0))) (.cse5 (= 1 ~m_pc~0)) (.cse0 (not (<= 2 ~E_1~0))) (.cse1 (not (<= 2 |old(~E_M~0)|))) (.cse14 (not (<= ~local~0 |old(~token~0)|))) (.cse3 (= 0 ~M_E~0)) (.cse4 (not (<= 2 ~T1_E~0))) (.cse11 (<= ~token~0 ~local~0)) (.cse13 (<= ~local~0 ~token~0)) (.cse6 (not (<= 2 |old(~m_st~0)|))) (.cse15 (not (<= |old(~token~0)| ~local~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse0 .cse1 .cse7 .cse2 .cse3 .cse4 .cse6) (or .cse0 .cse1 .cse7 (not (= 0 |old(~m_st~0)|)) (and .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) .cse14 .cse3 .cse4 .cse5 .cse15) (or .cse0 .cse1 .cse14 .cse3 .cse4 (and .cse9 .cse10 .cse11 (= 1 ~t1_pc~0) .cse12 .cse13) .cse6 (not (= 1 |old(~t1_pc~0)|)) .cse15)))) [2020-07-19 21:50:28,121 INFO L268 CegarLoopResult]: For program point L90(line 90) no Hoare annotation was computed. [2020-07-19 21:50:28,121 INFO L264 CegarLoopResult]: At program point L82(lines 77 108) the Hoare annotation is: (let ((.cse7 (= 1 ~m_pc~0)) (.cse9 (not (<= |old(~t1_pc~0)| 0))) (.cse0 (not (<= 2 ~E_1~0))) (.cse1 (not (<= 2 |old(~E_M~0)|))) (.cse10 (not (<= ~local~0 |old(~token~0)|))) (.cse5 (= 0 ~M_E~0)) (.cse6 (not (<= 2 ~T1_E~0))) (.cse2 (= ~m_st~0 |old(~m_st~0)|)) (.cse3 (= |old(~t1_st~0)| ~t1_st~0)) (.cse4 (= ~E_M~0 |old(~E_M~0)|)) (.cse8 (not (<= 2 |old(~m_st~0)|))) (.cse11 (not (<= |old(~token~0)| ~local~0)))) (and (or .cse0 .cse1 (and (= |old(~t1_pc~0)| ~t1_pc~0) .cse2 .cse3 .cse4 (= |old(~token~0)| ~token~0)) .cse5 .cse6 .cse7 .cse8) (or .cse0 .cse1 .cse9 (not (= 0 |old(~m_st~0)|)) .cse10 .cse5 .cse6 .cse7 .cse11) (or .cse0 .cse1 .cse9 .cse5 .cse6 .cse8) (or .cse0 .cse1 .cse10 .cse5 .cse6 (and .cse2 .cse3 (<= ~token~0 ~local~0) (= 1 ~t1_pc~0) .cse4 (<= ~local~0 ~token~0)) .cse8 (not (= 1 |old(~t1_pc~0)|)) .cse11))) [2020-07-19 21:50:28,122 INFO L268 CegarLoopResult]: For program point transmit1EXIT(lines 74 109) no Hoare annotation was computed. [2020-07-19 21:50:28,122 INFO L264 CegarLoopResult]: At program point L103(lines 74 109) the Hoare annotation is: (let ((.cse4 (= 1 ~m_pc~0)) (.cse8 (<= 2 ~E_M~0)) (.cse10 (<= 2 ~m_st~0)) (.cse17 (<= 2 ~E_1~0))) (let ((.cse11 (not (<= ~local~0 |old(~token~0)|))) (.cse12 (= 0 ~m_st~0)) (.cse14 (not (<= |old(~token~0)| ~local~0))) (.cse0 (not .cse17)) (.cse1 (not (<= 2 |old(~E_M~0)|))) (.cse15 (not (<= |old(~t1_pc~0)| 0))) (.cse2 (= 0 ~M_E~0)) (.cse3 (not (<= 2 ~T1_E~0))) (.cse7 (= 1 ~t1_pc~0)) (.cse9 (<= 2 ~t1_st~0)) (.cse16 (= ~E_M~0 |old(~E_M~0)|)) (.cse5 (not (<= 2 |old(~m_st~0)|))) (.cse6 (and .cse17 (not .cse4) .cse8 .cse10))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse0 .cse1 (and .cse7 .cse8 .cse9 .cse10) .cse11 .cse2 .cse3 (let ((.cse13 (+ ~local~0 1))) (and .cse12 (<= ~token~0 .cse13) (<= .cse13 ~token~0) .cse7 .cse8 .cse9)) .cse5 .cse6 (not (= 1 |old(~t1_pc~0)|)) .cse14) (or .cse0 .cse1 .cse15 (not (= 0 |old(~m_st~0)|)) .cse11 .cse2 .cse3 (and .cse12 (<= ~token~0 ~local~0) .cse7 .cse9 .cse16 (<= ~local~0 ~token~0)) .cse4 .cse14) (or .cse0 .cse1 .cse15 .cse2 .cse3 (and .cse7 .cse9 .cse16 .cse10) .cse5 .cse6)))) [2020-07-19 21:50:28,122 INFO L264 CegarLoopResult]: At program point L99(line 99) the Hoare annotation is: (let ((.cse2 (not (<= ~local~0 |old(~token~0)|))) (.cse9 (not (<= |old(~token~0)| ~local~0))) (.cse5 (= ~m_st~0 |old(~m_st~0)|)) (.cse6 (= |old(~t1_st~0)| ~t1_st~0)) (.cse11 (= 1 ~m_pc~0)) (.cse0 (not (<= 2 ~E_1~0))) (.cse1 (not (<= 2 |old(~E_M~0)|))) (.cse10 (not (<= |old(~t1_pc~0)| 0))) (.cse3 (= 0 ~M_E~0)) (.cse4 (not (<= 2 ~T1_E~0))) (.cse8 (not (<= 2 |old(~m_st~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (let ((.cse7 (+ ~local~0 1))) (and .cse5 .cse6 (<= ~token~0 .cse7) (<= .cse7 ~token~0) (= 1 ~t1_pc~0))) .cse8 (not (= 1 |old(~t1_pc~0)|)) .cse9) (or .cse0 .cse1 .cse10 (not (= 0 |old(~m_st~0)|)) .cse2 .cse3 .cse4 .cse11 .cse9) (or .cse0 (and .cse5 .cse6) .cse1 .cse3 .cse4 .cse11 .cse8) (or .cse0 .cse1 .cse10 .cse3 .cse4 .cse8))) [2020-07-19 21:50:28,122 INFO L268 CegarLoopResult]: For program point L99-1(line 99) no Hoare annotation was computed. [2020-07-19 21:50:28,122 INFO L268 CegarLoopResult]: For program point L317(lines 317 321) no Hoare annotation was computed. [2020-07-19 21:50:28,122 INFO L268 CegarLoopResult]: For program point L315(line 315) no Hoare annotation was computed. [2020-07-19 21:50:28,123 INFO L268 CegarLoopResult]: For program point L317-2(lines 301 325) no Hoare annotation was computed. [2020-07-19 21:50:28,123 INFO L268 CegarLoopResult]: For program point L309(lines 309 313) no Hoare annotation was computed. [2020-07-19 21:50:28,123 INFO L264 CegarLoopResult]: At program point L307(line 307) the Hoare annotation is: (let ((.cse15 (+ ~local~0 1))) (let ((.cse7 (not (<= ~token~0 ~local~0))) (.cse9 (not (<= ~local~0 ~token~0))) (.cse5 (not (<= 2 |old(~m_st~0)|))) (.cse0 (not (<= 2 ~E_1~0))) (.cse6 (not (= 1 ~t1_pc~0))) (.cse11 (not (<= 2 |old(~t1_st~0)|))) (.cse13 (not (<= .cse15 ~token~0))) (.cse14 (not (<= ~token~0 .cse15))) (.cse1 (and (= ~m_st~0 |old(~m_st~0)|) (= |old(~t1_st~0)| ~t1_st~0))) (.cse8 (not (<= 2 ~E_M~0))) (.cse2 (= 0 ~M_E~0)) (.cse3 (not (<= 2 ~T1_E~0))) (.cse10 (not (<= ~t1_pc~0 0))) (.cse4 (= 1 ~m_pc~0)) (.cse12 (= 0 ~E_1~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (or .cse1 .cse0 .cse6 .cse7 .cse8 .cse2 .cse3 .cse5 .cse9) (or .cse0 .cse1 .cse8 .cse2 .cse3 .cse10 .cse5) (or .cse1 .cse6 .cse7 .cse8 .cse11 .cse2 .cse3 .cse12 .cse9) (or .cse0 .cse1 .cse6 .cse8 .cse11 .cse2 .cse3 .cse5) (or .cse0 .cse1 .cse6 .cse2 .cse3 .cse13 .cse5 .cse14) (or .cse0 .cse1 .cse6 (not (= 0 |old(~m_st~0)|)) .cse8 .cse11 .cse2 .cse3 .cse13 .cse14) (or .cse1 .cse8 .cse2 .cse3 .cse10 .cse4 .cse12)))) [2020-07-19 21:50:28,123 INFO L264 CegarLoopResult]: At program point L309-2(lines 309 313) the Hoare annotation is: (let ((.cse15 (+ ~local~0 1))) (let ((.cse3 (not (<= ~token~0 ~local~0))) (.cse8 (not (<= ~local~0 ~token~0))) (.cse7 (not (<= 2 |old(~m_st~0)|))) (.cse0 (not (<= 2 ~E_1~0))) (.cse2 (not (= 1 ~t1_pc~0))) (.cse10 (not (<= 2 |old(~t1_st~0)|))) (.cse13 (not (<= .cse15 ~token~0))) (.cse14 (not (<= ~token~0 .cse15))) (.cse1 (and (= ~m_st~0 |old(~m_st~0)|) (= |old(~t1_st~0)| ~t1_st~0))) (.cse4 (not (<= 2 ~E_M~0))) (.cse5 (= 0 ~M_E~0)) (.cse6 (not (<= 2 ~T1_E~0))) (.cse9 (not (<= ~t1_pc~0 0))) (.cse12 (= 1 ~m_pc~0)) (.cse11 (= 0 ~E_1~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse0 .cse1 .cse4 .cse5 .cse6 .cse9 .cse7) (or .cse1 .cse2 .cse3 .cse4 .cse10 .cse5 .cse6 .cse11 .cse8) (or .cse0 .cse1 .cse2 .cse4 .cse10 .cse5 .cse6 .cse7) (or .cse1 .cse0 .cse5 .cse6 .cse12 .cse7) (or .cse1 .cse0 .cse2 (and (= 0 ~m_st~0) (= 1 ~E_M~0)) .cse5 .cse6 .cse13 .cse7 .cse14) (or .cse0 .cse1 .cse2 (not (= 0 |old(~m_st~0)|)) .cse4 .cse10 .cse5 .cse6 .cse13 .cse14) (or .cse1 .cse4 .cse5 .cse6 .cse9 .cse12 .cse11)))) [2020-07-19 21:50:28,123 INFO L268 CegarLoopResult]: For program point L307-1(line 307) no Hoare annotation was computed. [2020-07-19 21:50:28,123 INFO L264 CegarLoopResult]: At program point activate_threadsENTRY(lines 301 325) the Hoare annotation is: (let ((.cse15 (+ ~local~0 1))) (let ((.cse7 (not (<= ~token~0 ~local~0))) (.cse9 (not (<= ~local~0 ~token~0))) (.cse5 (not (<= 2 |old(~m_st~0)|))) (.cse0 (not (<= 2 ~E_1~0))) (.cse6 (not (= 1 ~t1_pc~0))) (.cse11 (not (<= 2 |old(~t1_st~0)|))) (.cse13 (not (<= .cse15 ~token~0))) (.cse14 (not (<= ~token~0 .cse15))) (.cse1 (and (= ~m_st~0 |old(~m_st~0)|) (= |old(~t1_st~0)| ~t1_st~0))) (.cse8 (not (<= 2 ~E_M~0))) (.cse2 (= 0 ~M_E~0)) (.cse3 (not (<= 2 ~T1_E~0))) (.cse10 (not (<= ~t1_pc~0 0))) (.cse4 (= 1 ~m_pc~0)) (.cse12 (= 0 ~E_1~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (or .cse1 .cse0 .cse6 .cse7 .cse8 .cse2 .cse3 .cse5 .cse9) (or .cse0 .cse1 .cse8 .cse2 .cse3 .cse10 .cse5) (or .cse1 .cse6 .cse7 .cse8 .cse11 .cse2 .cse3 .cse12 .cse9) (or .cse0 .cse1 .cse6 .cse8 .cse11 .cse2 .cse3 .cse5) (or .cse0 .cse1 .cse6 .cse2 .cse3 .cse13 .cse5 .cse14) (or .cse0 .cse1 .cse6 (not (= 0 |old(~m_st~0)|)) .cse8 .cse11 .cse2 .cse3 .cse13 .cse14) (or .cse1 .cse8 .cse2 .cse3 .cse10 .cse4 .cse12)))) [2020-07-19 21:50:28,124 INFO L268 CegarLoopResult]: For program point activate_threadsEXIT(lines 301 325) no Hoare annotation was computed. [2020-07-19 21:50:28,124 INFO L271 CegarLoopResult]: At program point L190(lines 177 192) the Hoare annotation is: true [2020-07-19 21:50:28,124 INFO L268 CegarLoopResult]: For program point exists_runnable_threadEXIT(lines 174 193) no Hoare annotation was computed. [2020-07-19 21:50:28,124 INFO L268 CegarLoopResult]: For program point L182(lines 182 187) no Hoare annotation was computed. [2020-07-19 21:50:28,124 INFO L271 CegarLoopResult]: At program point exists_runnable_threadENTRY(lines 174 193) the Hoare annotation is: true [2020-07-19 21:50:28,124 INFO L268 CegarLoopResult]: For program point L178(lines 178 188) no Hoare annotation was computed. [2020-07-19 21:50:28,124 INFO L268 CegarLoopResult]: For program point exists_runnable_threadFINAL(lines 174 193) no Hoare annotation was computed. [2020-07-19 21:50:28,124 INFO L268 CegarLoopResult]: For program point is_transmit1_triggeredFINAL(lines 129 147) no Hoare annotation was computed. [2020-07-19 21:50:28,124 INFO L271 CegarLoopResult]: At program point is_transmit1_triggeredENTRY(lines 129 147) the Hoare annotation is: true [2020-07-19 21:50:28,125 INFO L268 CegarLoopResult]: For program point is_transmit1_triggeredEXIT(lines 129 147) no Hoare annotation was computed. [2020-07-19 21:50:28,125 INFO L264 CegarLoopResult]: At program point L144(lines 132 146) the Hoare annotation is: (let ((.cse6 (= 1 ~m_pc~0)) (.cse7 (not (<= 2 ~E_M~0))) (.cse3 (not (<= 2 ~m_st~0))) (.cse8 (not (<= ~t1_pc~0 0))) (.cse0 (not (<= 2 ~E_1~0))) (.cse1 (not (= 1 ~t1_pc~0))) (.cse9 (not (= 0 ~m_st~0))) (.cse2 (and (<= 0 is_transmit1_triggered_~__retres1~1) (<= is_transmit1_triggered_~__retres1~1 0))) (.cse4 (= 0 ~M_E~0)) (.cse5 (not (<= 2 ~T1_E~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (or .cse0 .cse3 .cse4 .cse2 .cse5 .cse6) (or .cse7 .cse2 .cse4 .cse5 .cse8 .cse6 (= 0 ~E_1~0)) (or .cse0 .cse1 .cse9 (not (<= ~token~0 ~local~0)) .cse7 (not (<= 2 ~t1_st~0)) .cse2 .cse4 .cse5 .cse6 (not (<= ~local~0 ~token~0))) (or .cse0 .cse7 .cse2 .cse3 .cse4 .cse5 .cse8) (let ((.cse10 (+ ~local~0 1))) (or .cse0 .cse1 .cse9 .cse2 .cse4 .cse5 (not (<= .cse10 ~token~0)) (not (<= ~token~0 .cse10)))))) [2020-07-19 21:50:28,125 INFO L268 CegarLoopResult]: For program point L134(lines 134 139) no Hoare annotation was computed. [2020-07-19 21:50:28,125 INFO L268 CegarLoopResult]: For program point L133(lines 133 142) no Hoare annotation was computed. [2020-07-19 21:50:28,125 INFO L268 CegarLoopResult]: For program point L133-2(lines 133 142) no Hoare annotation was computed. [2020-07-19 21:50:28,125 INFO L268 CegarLoopResult]: For program point L287-1(lines 276 299) no Hoare annotation was computed. [2020-07-19 21:50:28,125 INFO L268 CegarLoopResult]: For program point L282-1(lines 276 299) no Hoare annotation was computed. [2020-07-19 21:50:28,125 INFO L268 CegarLoopResult]: For program point L277-1(lines 276 299) no Hoare annotation was computed. [2020-07-19 21:50:28,126 INFO L264 CegarLoopResult]: At program point reset_delta_eventsENTRY(lines 273 300) the Hoare annotation is: (let ((.cse9 (not (<= ~token~0 ~local~0))) (.cse11 (not (<= ~local~0 ~token~0))) (.cse12 (not (<= ~t1_pc~0 0))) (.cse4 (= 1 ~m_pc~0)) (.cse3 (not (<= 2 ~m_st~0))) (.cse0 (and (= |old(~T1_E~0)| ~T1_E~0) (= ~M_E~0 |old(~M_E~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_M~0 |old(~E_M~0)|))) (.cse1 (not (<= 2 |old(~E_M~0)|))) (.cse7 (not (= 1 ~t1_pc~0))) (.cse8 (not (= 0 ~m_st~0))) (.cse10 (not (<= 2 ~t1_st~0))) (.cse2 (not (<= 2 |old(~E_1~0)|))) (.cse5 (not (<= 2 |old(~T1_E~0)|))) (.cse6 (= 0 |old(~M_E~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse0 .cse1 .cse7 .cse8 .cse9 .cse10 .cse2 .cse4 .cse11 .cse5 .cse6) (or .cse0 .cse1 .cse2 .cse3 .cse12 .cse5 .cse6) (or .cse0 .cse1 .cse7 .cse9 .cse2 .cse3 .cse11 .cse5 .cse6) (or .cse0 .cse1 .cse8 .cse9 .cse2 .cse12 .cse4 .cse11 .cse5 .cse6) (or .cse0 .cse1 .cse8 .cse10 .cse2 .cse12 .cse4 .cse5 .cse6) (or .cse0 .cse1 .cse7 .cse10 .cse2 .cse3 .cse5 .cse6) (let ((.cse13 (+ ~local~0 1))) (or .cse0 .cse1 .cse7 .cse8 .cse10 .cse2 (not (<= .cse13 ~token~0)) .cse5 (not (<= ~token~0 .cse13)) .cse6)))) [2020-07-19 21:50:28,126 INFO L268 CegarLoopResult]: For program point reset_delta_eventsEXIT(lines 273 300) no Hoare annotation was computed. [2020-07-19 21:50:28,126 INFO L268 CegarLoopResult]: For program point L292-1(lines 273 300) no Hoare annotation was computed. [2020-07-19 21:50:28,126 INFO L268 CegarLoopResult]: For program point L160-1(lines 159 172) no Hoare annotation was computed. [2020-07-19 21:50:28,126 INFO L268 CegarLoopResult]: For program point init_threadsEXIT(lines 156 173) no Hoare annotation was computed. [2020-07-19 21:50:28,126 INFO L264 CegarLoopResult]: At program point init_threadsENTRY(lines 156 173) the Hoare annotation is: (or (not (<= 2 ~E_1~0)) (and (= ~m_st~0 |old(~m_st~0)|) (= |old(~t1_st~0)| ~t1_st~0)) (not (= 0 |old(~m_st~0)|)) (not (<= ~token~0 ~local~0)) (not (<= 2 ~E_M~0)) (not (<= 2 ~M_E~0)) (not (<= 2 ~T1_E~0)) (not (<= ~t1_pc~0 0)) (= 1 ~m_pc~0) (not (<= ~local~0 ~token~0))) [2020-07-19 21:50:28,126 INFO L268 CegarLoopResult]: For program point L165-1(lines 156 173) no Hoare annotation was computed. [2020-07-19 21:50:28,127 INFO L264 CegarLoopResult]: At program point mainENTRY(lines 462 473) the Hoare annotation is: (or (and (= ~t1_i~0 |old(~t1_i~0)|) (= |old(~t1_pc~0)| ~t1_pc~0) (= ~m_st~0 |old(~m_st~0)|) (= ~m_pc~0 |old(~m_pc~0)|) (= ~local~0 |old(~local~0)|) (= |old(~m_i~0)| ~m_i~0) (= |old(~t1_st~0)| ~t1_st~0) (= |old(~T1_E~0)| ~T1_E~0) (= ~M_E~0 |old(~M_E~0)|) (= ~E_1~0 |old(~E_1~0)|) (<= ~token~0 ~local~0) (= ~E_M~0 |old(~E_M~0)|) (<= ~local~0 ~token~0)) (not (<= 2 |old(~E_M~0)|)) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (<= 2 |old(~E_1~0)|)) (not (<= |old(~token~0)| |old(~local~0)|)) (= 1 |old(~m_pc~0)|) (not (<= |old(~local~0)| |old(~token~0)|)) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|))) [2020-07-19 21:50:28,127 INFO L268 CegarLoopResult]: For program point mainFINAL(lines 462 473) no Hoare annotation was computed. [2020-07-19 21:50:28,127 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 462 473) no Hoare annotation was computed. [2020-07-19 21:50:28,127 INFO L268 CegarLoopResult]: For program point L468(line 468) no Hoare annotation was computed. [2020-07-19 21:50:28,127 INFO L264 CegarLoopResult]: At program point L467(line 467) the Hoare annotation is: (or (and (= ~t1_i~0 |old(~t1_i~0)|) (= |old(~t1_pc~0)| ~t1_pc~0) (= ~m_st~0 |old(~m_st~0)|) (= ~m_pc~0 |old(~m_pc~0)|) (= ~local~0 |old(~local~0)|) (= |old(~m_i~0)| ~m_i~0) (= |old(~t1_st~0)| ~t1_st~0) (= |old(~T1_E~0)| ~T1_E~0) (= ~M_E~0 |old(~M_E~0)|) (= ~E_1~0 |old(~E_1~0)|) (<= ~token~0 ~local~0) (= ~E_M~0 |old(~E_M~0)|) (<= ~local~0 ~token~0)) (not (<= 2 |old(~E_M~0)|)) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (<= 2 |old(~E_1~0)|)) (not (<= |old(~token~0)| |old(~local~0)|)) (= 1 |old(~m_pc~0)|) (not (<= |old(~local~0)| |old(~token~0)|)) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|))) [2020-07-19 21:50:28,127 INFO L264 CegarLoopResult]: At program point L467-1(line 467) the Hoare annotation is: (or (and (= |old(~t1_pc~0)| ~t1_pc~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t1_st~0)| ~t1_st~0) (= ~m_pc~0 |old(~m_pc~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~M_E~0 |old(~M_E~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~local~0 |old(~local~0)|) (<= ~token~0 ~local~0) (= ~E_M~0 |old(~E_M~0)|) (<= ~local~0 ~token~0)) (not (<= 2 |old(~E_M~0)|)) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (<= 2 |old(~E_1~0)|)) (not (<= |old(~token~0)| |old(~local~0)|)) (= 1 |old(~m_pc~0)|) (not (<= |old(~local~0)| |old(~token~0)|)) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|))) [2020-07-19 21:50:28,127 INFO L268 CegarLoopResult]: For program point errorEXIT(lines 6 13) no Hoare annotation was computed. [2020-07-19 21:50:28,128 INFO L268 CegarLoopResult]: For program point errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 10) no Hoare annotation was computed. [2020-07-19 21:50:28,128 INFO L271 CegarLoopResult]: At program point errorENTRY(lines 6 13) the Hoare annotation is: true [2020-07-19 21:50:28,128 INFO L268 CegarLoopResult]: For program point errorFINAL(lines 6 13) no Hoare annotation was computed. [2020-07-19 21:50:28,128 INFO L268 CegarLoopResult]: For program point masterEXIT(lines 30 73) no Hoare annotation was computed. [2020-07-19 21:50:28,128 INFO L268 CegarLoopResult]: For program point L46(line 46) no Hoare annotation was computed. [2020-07-19 21:50:28,128 INFO L264 CegarLoopResult]: At program point L38(lines 33 72) the Hoare annotation is: (let ((.cse9 (+ |old(~local~0)| 1))) (let ((.cse0 (not (= 1 ~t1_pc~0))) (.cse1 (not (<= 2 ~E_M~0))) (.cse2 (not (<= |old(~token~0)| .cse9))) (.cse3 (not (<= 2 |old(~t1_st~0)|))) (.cse4 (not (<= 2 |old(~E_1~0)|))) (.cse5 (= 0 ~M_E~0)) (.cse8 (= 1 |old(~m_pc~0)|)) (.cse6 (not (<= 2 ~T1_E~0))) (.cse7 (not (<= .cse9 |old(~token~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (and (= ~m_st~0 |old(~m_st~0)|) (= |old(~t1_st~0)| ~t1_st~0) (= ~m_pc~0 |old(~m_pc~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~local~0 |old(~local~0)|) (= |old(~token~0)| ~token~0)) .cse5 .cse6 .cse7) (or .cse0 .cse1 .cse3 .cse4 (not (<= |old(~token~0)| |old(~local~0)|)) .cse5 .cse8 (not (<= |old(~local~0)| |old(~token~0)|)) .cse6) (or .cse1 .cse4 .cse5 .cse8 .cse6 (not (<= ~t1_pc~0 0))) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse8 .cse6 .cse7)))) [2020-07-19 21:50:28,129 INFO L264 CegarLoopResult]: At program point L67(lines 30 73) the Hoare annotation is: (let ((.cse12 (<= 2 ~E_1~0)) (.cse14 (<= 2 ~T1_E~0)) (.cse6 (<= 2 ~t1_st~0)) (.cse15 (<= 2 ~E_M~0)) (.cse13 (<= 2 ~m_st~0))) (let ((.cse8 (not (= 1 ~t1_pc~0))) (.cse1 (not (<= 2 |old(~t1_st~0)|))) (.cse9 (and .cse12 .cse14 .cse6 .cse15 .cse13)) (.cse10 (and .cse12 (<= ~token~0 ~local~0) .cse15 (<= ~local~0 ~token~0) .cse13)) (.cse0 (not .cse15)) (.cse2 (not (<= 2 |old(~E_1~0)|))) (.cse3 (= 0 ~M_E~0)) (.cse4 (= 1 |old(~m_pc~0)|)) (.cse5 (not .cse14)) (.cse7 (not (<= ~t1_pc~0 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (or .cse8 .cse0 .cse1 .cse2 (not (<= |old(~token~0)| |old(~local~0)|)) .cse3 .cse4 (not (<= |old(~local~0)| |old(~token~0)|)) .cse5 .cse9 .cse10) (let ((.cse11 (+ |old(~local~0)| 1))) (or .cse8 .cse0 (not (<= |old(~token~0)| .cse11)) .cse1 .cse2 .cse3 .cse5 (not (<= .cse11 |old(~token~0)|)) .cse9 .cse10)) (or (and .cse12 .cse13) .cse0 .cse2 .cse3 .cse4 .cse5 .cse7)))) [2020-07-19 21:50:28,129 INFO L264 CegarLoopResult]: At program point L61(line 61) the Hoare annotation is: (let ((.cse0 (not (= 1 ~t1_pc~0))) (.cse2 (not (<= 2 |old(~t1_st~0)|))) (.cse1 (not (<= 2 ~E_M~0))) (.cse3 (not (<= 2 |old(~E_1~0)|))) (.cse4 (= 0 ~M_E~0)) (.cse5 (= 1 |old(~m_pc~0)|)) (.cse6 (not (<= 2 ~T1_E~0)))) (and (or .cse0 .cse1 .cse2 .cse3 (not (<= |old(~token~0)| |old(~local~0)|)) .cse4 .cse5 (not (<= |old(~local~0)| |old(~token~0)|)) .cse6) (let ((.cse7 (+ |old(~local~0)| 1))) (or .cse0 .cse1 (not (<= |old(~token~0)| .cse7)) .cse2 .cse3 .cse4 .cse6 (not (<= .cse7 |old(~token~0)|)))) (or .cse1 .cse3 .cse4 .cse5 .cse6 (not (<= ~t1_pc~0 0))))) [2020-07-19 21:50:28,129 INFO L264 CegarLoopResult]: At program point L59(lines 33 72) the Hoare annotation is: (let ((.cse7 (= ~m_st~0 |old(~m_st~0)|)) (.cse8 (= |old(~t1_st~0)| ~t1_st~0)) (.cse9 (= ~m_pc~0 |old(~m_pc~0)|)) (.cse10 (= ~E_1~0 |old(~E_1~0)|)) (.cse11 (= |old(~token~0)| ~token~0))) (let ((.cse4 (= 1 |old(~m_pc~0)|)) (.cse6 (not (= 1 ~t1_pc~0))) (.cse0 (not (<= 2 ~E_M~0))) (.cse12 (not (<= 2 |old(~t1_st~0)|))) (.cse1 (not (<= 2 |old(~E_1~0)|))) (.cse3 (and .cse7 .cse8 .cse9 .cse10 (= ~local~0 |old(~local~0)|) .cse11)) (.cse2 (= 0 ~M_E~0)) (.cse5 (not (<= 2 ~T1_E~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (<= ~t1_pc~0 0))) (or .cse6 .cse0 (and .cse7 .cse8 .cse9 .cse10 (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) .cse11) .cse12 .cse1 (not (<= |old(~token~0)| |old(~local~0)|)) .cse2 .cse4 (not (<= |old(~local~0)| |old(~token~0)|)) .cse5) (let ((.cse13 (+ |old(~local~0)| 1))) (or .cse6 .cse0 (not (<= |old(~token~0)| .cse13)) .cse12 .cse1 .cse3 .cse2 .cse5 (not (<= .cse13 |old(~token~0)|))))))) [2020-07-19 21:50:28,129 INFO L264 CegarLoopResult]: At program point L51(line 51) the Hoare annotation is: (let ((.cse16 (+ |old(~local~0)| 1)) (.cse15 (not (= 1 ~m_pc~0))) (.cse4 (= ~m_st~0 |old(~m_st~0)|)) (.cse5 (= |old(~t1_st~0)| ~t1_st~0)) (.cse6 (not (= 0 ~E_1~0))) (.cse7 (<= ~token~0 ~local~0)) (.cse8 (<= ~local~0 ~token~0))) (let ((.cse13 (and .cse15 .cse4 .cse5 .cse6 .cse7 .cse8)) (.cse0 (not (= 1 ~t1_pc~0))) (.cse2 (not (<= |old(~token~0)| .cse16))) (.cse3 (not (<= 2 |old(~t1_st~0)|))) (.cse12 (not (<= .cse16 |old(~token~0)|))) (.cse1 (not (<= 2 ~E_M~0))) (.cse9 (not (<= 2 |old(~E_1~0)|))) (.cse10 (= 0 ~M_E~0)) (.cse14 (= 1 |old(~m_pc~0)|)) (.cse11 (not (<= 2 ~T1_E~0)))) (and (or .cse0 .cse1 .cse2 .cse3 (and .cse4 .cse5 .cse6 .cse7 .cse8) .cse9 .cse10 .cse11 .cse12) (or .cse13 .cse0 .cse1 .cse3 .cse9 (not (<= |old(~token~0)| |old(~local~0)|)) .cse10 .cse14 (not (<= |old(~local~0)| |old(~token~0)|)) .cse11) (or .cse13 .cse0 .cse1 .cse2 .cse3 .cse9 .cse10 .cse14 .cse11 .cse12) (or (and .cse15 .cse4 .cse5 .cse6) .cse1 .cse9 .cse10 .cse14 .cse11 (not (<= ~t1_pc~0 0)))))) [2020-07-19 21:50:28,129 INFO L268 CegarLoopResult]: For program point L51-1(line 51) no Hoare annotation was computed. [2020-07-19 21:50:28,130 INFO L264 CegarLoopResult]: At program point masterENTRY(lines 30 73) the Hoare annotation is: (let ((.cse7 (= ~m_st~0 |old(~m_st~0)|)) (.cse8 (= |old(~t1_st~0)| ~t1_st~0)) (.cse9 (= ~m_pc~0 |old(~m_pc~0)|)) (.cse10 (= ~E_1~0 |old(~E_1~0)|)) (.cse11 (= |old(~token~0)| ~token~0))) (let ((.cse4 (= 1 |old(~m_pc~0)|)) (.cse6 (not (= 1 ~t1_pc~0))) (.cse0 (not (<= 2 ~E_M~0))) (.cse12 (not (<= 2 |old(~t1_st~0)|))) (.cse1 (not (<= 2 |old(~E_1~0)|))) (.cse3 (and .cse7 .cse8 .cse9 .cse10 (= ~local~0 |old(~local~0)|) .cse11)) (.cse2 (= 0 ~M_E~0)) (.cse5 (not (<= 2 ~T1_E~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (<= ~t1_pc~0 0))) (or .cse6 .cse0 (and .cse7 .cse8 .cse9 .cse10 (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) .cse11) .cse12 .cse1 (not (<= |old(~token~0)| |old(~local~0)|)) .cse2 .cse4 (not (<= |old(~local~0)| |old(~token~0)|)) .cse5) (let ((.cse13 (+ |old(~local~0)| 1))) (or .cse6 .cse0 (not (<= |old(~token~0)| .cse13)) .cse12 .cse1 .cse3 .cse2 .cse5 (not (<= .cse13 |old(~token~0)|))))))) [2020-07-19 21:50:28,130 INFO L268 CegarLoopResult]: For program point L37(lines 37 41) no Hoare annotation was computed. [2020-07-19 21:50:28,130 INFO L268 CegarLoopResult]: For program point fire_time_eventsEXIT(lines 337 345) no Hoare annotation was computed. [2020-07-19 21:50:28,130 INFO L264 CegarLoopResult]: At program point fire_time_eventsENTRY(lines 337 345) the Hoare annotation is: (let ((.cse5 (not (<= 2 ~m_st~0))) (.cse1 (not (= 1 ~t1_pc~0))) (.cse3 (not (<= 2 ~t1_st~0))) (.cse0 (not (<= 2 ~E_1~0))) (.cse12 (not (= 0 ~m_st~0))) (.cse10 (not (<= ~token~0 ~local~0))) (.cse2 (not (<= 2 ~E_M~0))) (.cse4 (= ~M_E~0 |old(~M_E~0)|)) (.cse6 (not (<= 2 ~T1_E~0))) (.cse8 (not (<= ~t1_pc~0 0))) (.cse9 (= 1 ~m_pc~0)) (.cse11 (not (<= ~local~0 ~token~0))) (.cse7 (= 0 |old(~M_E~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (or .cse0 .cse2 .cse4 .cse5 .cse6 .cse8 .cse7) (or .cse0 .cse2 .cse4 .cse5 .cse6 .cse9 .cse7) (or .cse0 .cse1 .cse10 .cse2 .cse4 .cse5 .cse6 .cse11 .cse7) (or .cse0 .cse1 .cse12 .cse10 .cse2 .cse4 .cse3 .cse6 .cse9 .cse11 .cse7) (or .cse0 .cse12 .cse2 .cse3 .cse4 .cse6 .cse8 .cse9 .cse7) (let ((.cse13 (+ ~local~0 1))) (or .cse0 .cse1 .cse12 .cse2 .cse3 .cse4 .cse6 (not (<= .cse13 ~token~0)) (not (<= ~token~0 .cse13)) .cse7)) (or .cse0 .cse12 .cse10 .cse2 .cse4 .cse6 .cse8 .cse9 .cse11 .cse7))) [2020-07-19 21:50:28,130 INFO L268 CegarLoopResult]: For program point fire_time_eventsFINAL(lines 337 345) no Hoare annotation was computed. [2020-07-19 21:50:28,130 INFO L268 CegarLoopResult]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2020-07-19 21:50:28,131 INFO L264 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~t1_pc~0 |old(~t1_pc~0)|) (= ~t1_i~0 |old(~t1_i~0)|) (= ~m_st~0 |old(~m_st~0)|) (= ~M_E~0 |old(~M_E~0)|) (= ~token~0 |old(~token~0)|) (= ~m_pc~0 |old(~m_pc~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~local~0 |old(~local~0)|) (= ~T1_E~0 |old(~T1_E~0)|) (= ~t1_st~0 |old(~t1_st~0)|) (= ~m_i~0 |old(~m_i~0)|) (= ~E_M~0 |old(~E_M~0)|)) [2020-07-19 21:50:28,131 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-07-19 21:50:28,131 INFO L264 CegarLoopResult]: At program point evalENTRY(lines 194 244) the Hoare annotation is: (let ((.cse22 (= |old(~t1_pc~0)| ~t1_pc~0)) (.cse7 (= |old(~token~0)| ~token~0)) (.cse0 (= ~m_st~0 |old(~m_st~0)|)) (.cse1 (= |old(~t1_st~0)| ~t1_st~0)) (.cse2 (= ~m_pc~0 |old(~m_pc~0)|)) (.cse3 (= ~E_1~0 |old(~E_1~0)|)) (.cse4 (= ~local~0 |old(~local~0)|)) (.cse23 (<= ~token~0 ~local~0)) (.cse5 (= 1 ~t1_pc~0)) (.cse6 (= ~E_M~0 |old(~E_M~0)|)) (.cse24 (<= ~local~0 ~token~0))) (let ((.cse19 (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse23 .cse5 .cse6 .cse24)) (.cse20 (not (<= |old(~token~0)| |old(~local~0)|))) (.cse17 (= 1 |old(~m_pc~0)|)) (.cse21 (not (<= |old(~local~0)| |old(~token~0)|))) (.cse15 (not (<= |old(~t1_pc~0)| 0))) (.cse18 (and .cse22 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7)) (.cse13 (not (<= 2 |old(~m_st~0)|))) (.cse8 (not (<= 2 |old(~E_M~0)|))) (.cse16 (not (= 0 |old(~m_st~0)|))) (.cse9 (not (<= 2 |old(~t1_st~0)|))) (.cse10 (not (<= 2 |old(~E_1~0)|))) (.cse11 (= 0 ~M_E~0)) (.cse12 (not (<= 2 ~T1_E~0))) (.cse14 (not (= 1 |old(~t1_pc~0)|)))) (and (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (or .cse8 .cse15 .cse16 .cse9 .cse10 .cse11 .cse17 .cse12 .cse18) (or .cse8 .cse19 .cse10 .cse20 .cse11 .cse21 .cse12 .cse13 .cse14) (or .cse8 .cse10 .cse11 .cse17 .cse12 .cse18 .cse13) (or .cse8 .cse15 .cse16 (and .cse22 .cse0 .cse1 .cse2 .cse3 .cse4 .cse23 .cse6 .cse24) .cse10 .cse20 .cse11 .cse17 .cse21 .cse12) (or .cse8 .cse16 .cse9 .cse19 .cse10 .cse20 .cse11 .cse17 .cse21 .cse12 .cse14) (or .cse8 .cse15 .cse10 .cse11 .cse12 .cse18 .cse13) (let ((.cse25 (+ |old(~local~0)| 1))) (or .cse8 .cse16 (not (<= |old(~token~0)| .cse25)) .cse9 .cse10 .cse11 .cse12 (let ((.cse26 (+ ~local~0 1))) (and .cse0 .cse1 .cse2 .cse3 (<= ~token~0 .cse26) .cse4 (<= .cse26 ~token~0) .cse5 .cse6)) (not (<= .cse25 |old(~token~0)|)) .cse14))))) [2020-07-19 21:50:28,131 INFO L268 CegarLoopResult]: For program point L213(lines 213 220) no Hoare annotation was computed. [2020-07-19 21:50:28,131 INFO L268 CegarLoopResult]: For program point L205(lines 205 209) no Hoare annotation was computed. [2020-07-19 21:50:28,132 INFO L268 CegarLoopResult]: For program point L205-1(lines 200 238) no Hoare annotation was computed. [2020-07-19 21:50:28,132 INFO L268 CegarLoopResult]: For program point L203(line 203) no Hoare annotation was computed. [2020-07-19 21:50:28,132 INFO L264 CegarLoopResult]: At program point L201(line 201) the Hoare annotation is: (let ((.cse2 (= 0 ~M_E~0))) (let ((.cse35 (not (= 1 ~m_pc~0))) (.cse17 (<= ~token~0 ~local~0)) (.cse20 (<= ~local~0 ~token~0)) (.cse32 (<= 2 ~m_st~0)) (.cse33 (= 0 ~m_st~0)) (.cse28 (<= 2 ~E_1~0)) (.cse29 (<= 2 ~T1_E~0)) (.cse30 (not .cse2)) (.cse18 (= 1 ~t1_pc~0)) (.cse31 (<= 2 ~E_M~0)) (.cse34 (<= 2 ~t1_st~0))) (let ((.cse23 (not (= 1 |old(~t1_pc~0)|))) (.cse9 (not (<= |old(~token~0)| |old(~local~0)|))) (.cse10 (not (<= |old(~local~0)| |old(~token~0)|))) (.cse11 (let ((.cse36 (+ ~local~0 1))) (and .cse33 .cse28 .cse29 (<= ~token~0 .cse36) (<= .cse36 ~token~0) .cse30 .cse18 .cse31 .cse34))) (.cse12 (and .cse28 .cse29 .cse17 .cse30 .cse18 .cse31 .cse20 .cse32)) (.cse24 (and .cse28 .cse29 .cse30 .cse18 .cse31 .cse34 .cse32)) (.cse22 (not (= 0 |old(~m_st~0)|))) (.cse8 (not (<= 2 |old(~t1_st~0)|))) (.cse3 (= 1 |old(~m_pc~0)|)) (.cse15 (= ~m_pc~0 |old(~m_pc~0)|)) (.cse0 (not (<= 2 |old(~E_M~0)|))) (.cse7 (not (<= |old(~t1_pc~0)| 0))) (.cse1 (not (<= 2 |old(~E_1~0)|))) (.cse4 (not .cse29)) (.cse5 (and .cse28 .cse35 .cse29 .cse30 .cse31 .cse32)) (.cse6 (not (<= 2 |old(~m_st~0)|))) (.cse27 (= |old(~t1_pc~0)| ~t1_pc~0)) (.cse13 (= ~m_st~0 |old(~m_st~0)|)) (.cse14 (= |old(~t1_st~0)| ~t1_st~0)) (.cse16 (= ~E_1~0 |old(~E_1~0)|)) (.cse26 (= ~local~0 |old(~local~0)|)) (.cse19 (= ~E_M~0 |old(~E_M~0)|)) (.cse21 (= |old(~token~0)| ~token~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse0 .cse7 .cse8 .cse1 .cse2 .cse4 .cse5 .cse6 (<= ~t1_pc~0 0)) (or .cse8 .cse9 .cse10 .cse4 .cse11 .cse0 .cse12 (and .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) .cse22 .cse2 .cse1 .cse3 .cse5 .cse23 .cse24) (let ((.cse25 (+ |old(~local~0)| 1))) (or .cse8 .cse4 .cse11 .cse0 .cse12 .cse22 (not (<= |old(~token~0)| .cse25)) .cse2 .cse1 .cse5 (not (<= .cse25 |old(~token~0)|)) .cse23 .cse24)) (or .cse11 .cse0 .cse12 .cse9 .cse2 .cse1 .cse10 .cse4 .cse5 .cse6 .cse23 .cse24) (or .cse0 .cse8 .cse1 .cse2 .cse4 .cse5 (and .cse13 .cse14 .cse16 .cse26 .cse18 .cse19 .cse21) .cse6 .cse23) (or (and .cse27 .cse13 .cse14 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21) .cse9 .cse10 .cse4 (and .cse28 .cse27 .cse29 .cse30 .cse31 .cse32) .cse11 .cse0 .cse12 .cse7 .cse22 .cse2 .cse1 .cse3 .cse5 (and .cse33 .cse28 .cse29 .cse31 .cse34 .cse21 .cse35 .cse16 .cse17 .cse30 .cse18 .cse19 .cse20) .cse24) (or .cse0 .cse7 .cse22 .cse8 .cse1 .cse2 .cse3 (and .cse28 .cse27 .cse29 .cse30 .cse31 .cse34 .cse32) .cse4 (and .cse27 .cse13 .cse14 .cse15 .cse16 .cse26 .cse19 .cse21) .cse5) (or .cse0 (and .cse16 .cse18 .cse34 .cse19 .cse32) .cse7 .cse1 .cse2 .cse4 .cse5 .cse6 (and .cse27 .cse13 .cse14 .cse16 .cse26 .cse19 .cse21)))))) [2020-07-19 21:50:28,133 INFO L264 CegarLoopResult]: At program point L230(line 230) the Hoare annotation is: (let ((.cse2 (= 0 ~M_E~0))) (let ((.cse26 (not (= 1 ~m_pc~0))) (.cse19 (<= 2 ~E_1~0)) (.cse20 (<= 2 ~T1_E~0)) (.cse23 (<= ~token~0 ~local~0)) (.cse27 (= 1 |old(~t1_pc~0)|)) (.cse21 (not .cse2)) (.cse24 (= 1 ~t1_pc~0)) (.cse22 (<= 2 ~E_M~0)) (.cse25 (<= ~local~0 ~token~0)) (.cse16 (<= 2 ~m_st~0))) (let ((.cse10 (and .cse19 .cse20 .cse23 .cse27 .cse21 .cse24 .cse22 .cse25 .cse16)) (.cse11 (not .cse27)) (.cse9 (not (<= 2 |old(~t1_st~0)|))) (.cse6 (not (<= 2 |old(~m_st~0)|))) (.cse17 (not (<= |old(~token~0)| |old(~local~0)|))) (.cse18 (not (<= |old(~local~0)| |old(~token~0)|))) (.cse4 (not .cse20)) (.cse0 (not (<= 2 |old(~E_M~0)|))) (.cse12 (not (<= |old(~t1_pc~0)| 0))) (.cse7 (not (= 0 |old(~m_st~0)|))) (.cse13 (= |old(~t1_pc~0)| ~t1_pc~0)) (.cse14 (= ~E_1~0 |old(~E_1~0)|)) (.cse15 (= ~E_M~0 |old(~E_M~0)|)) (.cse1 (not (<= 2 |old(~E_1~0)|))) (.cse3 (= 1 |old(~m_pc~0)|)) (.cse5 (and .cse19 .cse26 .cse20 .cse21 .cse22 .cse16))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (let ((.cse8 (+ |old(~local~0)| 1))) (or .cse0 .cse7 (not (<= |old(~token~0)| .cse8)) .cse9 .cse10 .cse1 .cse2 .cse4 .cse5 (not (<= .cse8 |old(~token~0)|)) .cse11)) (or .cse0 .cse9 .cse1 .cse2 .cse4 .cse5 .cse6 .cse11) (or .cse0 .cse12 .cse1 .cse2 .cse4 .cse5 .cse6 (and .cse13 .cse14 .cse15 .cse16)) (or .cse0 .cse10 .cse1 .cse17 .cse2 .cse18 .cse4 .cse5 .cse6 .cse11) (or .cse0 .cse12 .cse7 .cse9 .cse1 .cse2 .cse3 .cse4 .cse5) (or .cse0 .cse7 .cse9 .cse10 .cse1 .cse17 .cse2 .cse3 .cse18 .cse4 .cse5 .cse11) (or .cse0 .cse12 .cse9 .cse1 .cse2 .cse4 .cse5 .cse6) (or .cse17 .cse18 .cse4 (and .cse19 .cse13 .cse20 .cse21 .cse22 .cse16) .cse0 .cse12 .cse7 (and .cse19 .cse20 .cse23 .cse21 .cse24 .cse22 .cse25 .cse16) (and (= 0 ~m_st~0) .cse13 .cse26 .cse14 .cse23 .cse15 .cse25 (= |old(~token~0)| ~token~0)) .cse2 .cse1 .cse3 .cse5))))) [2020-07-19 21:50:28,133 INFO L264 CegarLoopResult]: At program point L224(lines 200 238) the Hoare annotation is: (let ((.cse2 (= 0 ~M_E~0))) (let ((.cse35 (not (= 1 ~m_pc~0))) (.cse17 (<= ~token~0 ~local~0)) (.cse20 (<= ~local~0 ~token~0)) (.cse32 (<= 2 ~m_st~0)) (.cse33 (= 0 ~m_st~0)) (.cse28 (<= 2 ~E_1~0)) (.cse29 (<= 2 ~T1_E~0)) (.cse30 (not .cse2)) (.cse18 (= 1 ~t1_pc~0)) (.cse31 (<= 2 ~E_M~0)) (.cse34 (<= 2 ~t1_st~0))) (let ((.cse23 (not (= 1 |old(~t1_pc~0)|))) (.cse9 (not (<= |old(~token~0)| |old(~local~0)|))) (.cse10 (not (<= |old(~local~0)| |old(~token~0)|))) (.cse11 (let ((.cse36 (+ ~local~0 1))) (and .cse33 .cse28 .cse29 (<= ~token~0 .cse36) (<= .cse36 ~token~0) .cse30 .cse18 .cse31 .cse34))) (.cse12 (and .cse28 .cse29 .cse17 .cse30 .cse18 .cse31 .cse20 .cse32)) (.cse24 (and .cse28 .cse29 .cse30 .cse18 .cse31 .cse34 .cse32)) (.cse22 (not (= 0 |old(~m_st~0)|))) (.cse8 (not (<= 2 |old(~t1_st~0)|))) (.cse3 (= 1 |old(~m_pc~0)|)) (.cse15 (= ~m_pc~0 |old(~m_pc~0)|)) (.cse0 (not (<= 2 |old(~E_M~0)|))) (.cse7 (not (<= |old(~t1_pc~0)| 0))) (.cse1 (not (<= 2 |old(~E_1~0)|))) (.cse4 (not .cse29)) (.cse5 (and .cse28 .cse35 .cse29 .cse30 .cse31 .cse32)) (.cse6 (not (<= 2 |old(~m_st~0)|))) (.cse27 (= |old(~t1_pc~0)| ~t1_pc~0)) (.cse13 (= ~m_st~0 |old(~m_st~0)|)) (.cse14 (= |old(~t1_st~0)| ~t1_st~0)) (.cse16 (= ~E_1~0 |old(~E_1~0)|)) (.cse26 (= ~local~0 |old(~local~0)|)) (.cse19 (= ~E_M~0 |old(~E_M~0)|)) (.cse21 (= |old(~token~0)| ~token~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse0 .cse7 .cse8 .cse1 .cse2 .cse4 .cse5 .cse6 (<= ~t1_pc~0 0)) (or .cse8 .cse9 .cse10 .cse4 .cse11 .cse0 .cse12 (and .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) .cse22 .cse2 .cse1 .cse3 .cse5 .cse23 .cse24) (let ((.cse25 (+ |old(~local~0)| 1))) (or .cse8 .cse4 .cse11 .cse0 .cse12 .cse22 (not (<= |old(~token~0)| .cse25)) .cse2 .cse1 .cse5 (not (<= .cse25 |old(~token~0)|)) .cse23 .cse24)) (or .cse11 .cse0 .cse12 .cse9 .cse2 .cse1 .cse10 .cse4 .cse5 .cse6 .cse23 .cse24) (or .cse0 .cse8 .cse1 .cse2 .cse4 .cse5 (and .cse13 .cse14 .cse16 .cse26 .cse18 .cse19 .cse21) .cse6 .cse23) (or (and .cse27 .cse13 .cse14 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21) .cse9 .cse10 .cse4 (and .cse28 .cse27 .cse29 .cse30 .cse31 .cse32) .cse11 .cse0 .cse12 .cse7 .cse22 .cse2 .cse1 .cse3 .cse5 (and .cse33 .cse28 .cse29 .cse31 .cse34 .cse21 .cse35 .cse16 .cse17 .cse30 .cse18 .cse19 .cse20) .cse24) (or .cse0 .cse7 .cse22 .cse8 .cse1 .cse2 .cse3 (and .cse28 .cse27 .cse29 .cse30 .cse31 .cse34 .cse32) .cse4 (and .cse27 .cse13 .cse14 .cse15 .cse16 .cse26 .cse19 .cse21) .cse5) (or .cse0 (and .cse16 .cse18 .cse34 .cse19 .cse32) .cse7 .cse1 .cse2 .cse4 .cse5 .cse6 (and .cse27 .cse13 .cse14 .cse16 .cse26 .cse19 .cse21)))))) [2020-07-19 21:50:28,133 INFO L268 CegarLoopResult]: For program point evalEXIT(lines 194 244) no Hoare annotation was computed. [2020-07-19 21:50:28,134 INFO L264 CegarLoopResult]: At program point L216(line 216) the Hoare annotation is: (let ((.cse28 (+ ~local~0 1))) (let ((.cse23 (<= 2 ~E_1~0)) (.cse24 (<= 2 ~T1_E~0)) (.cse26 (<= ~token~0 .cse28)) (.cse27 (<= .cse28 ~token~0)) (.cse14 (= 1 ~t1_pc~0)) (.cse25 (<= 2 ~E_M~0)) (.cse15 (<= 2 ~t1_st~0))) (let ((.cse7 (not (= 0 |old(~m_st~0)|))) (.cse3 (= 1 |old(~m_pc~0)|)) (.cse22 (= |old(~t1_pc~0)| ~t1_pc~0)) (.cse11 (not (= 1 ~m_pc~0))) (.cse12 (= ~E_1~0 |old(~E_1~0)|)) (.cse13 (<= ~token~0 ~local~0)) (.cse16 (= ~E_M~0 |old(~E_M~0)|)) (.cse17 (<= ~local~0 ~token~0)) (.cse18 (= |old(~token~0)| ~token~0)) (.cse6 (and .cse23 .cse24 .cse26 .cse27 .cse14 .cse25 .cse15)) (.cse9 (not (<= |old(~token~0)| |old(~local~0)|))) (.cse10 (not (<= |old(~local~0)| |old(~token~0)|))) (.cse8 (not (<= 2 |old(~t1_st~0)|))) (.cse19 (not (= 1 |old(~t1_pc~0)|))) (.cse0 (not (<= 2 |old(~E_M~0)|))) (.cse21 (not (<= |old(~t1_pc~0)| 0))) (.cse1 (not (<= 2 |old(~E_1~0)|))) (.cse2 (= 0 ~M_E~0)) (.cse4 (not .cse24)) (.cse5 (not (<= 2 |old(~m_st~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (or .cse0 .cse6 .cse7 .cse8 .cse1 .cse9 .cse2 .cse3 .cse10 .cse4 (and .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) .cse19) (let ((.cse20 (+ |old(~local~0)| 1))) (or .cse0 .cse6 .cse7 (not (<= |old(~token~0)| .cse20)) .cse8 .cse1 .cse2 .cse4 (not (<= .cse20 |old(~token~0)|)) .cse19)) (or .cse0 .cse21 .cse7 .cse8 (and .cse22 .cse11 .cse12 .cse15 .cse16) .cse1 .cse2 .cse3 .cse4) (or .cse0 .cse21 .cse7 .cse1 .cse9 .cse2 .cse3 .cse10 .cse4 (and .cse23 .cse22 .cse11 .cse24 .cse12 .cse25 .cse16) (and .cse23 .cse24 .cse26 .cse27 .cse14 .cse15 .cse25) (and .cse23 .cse11 .cse24 .cse12 .cse13 .cse14 .cse25 .cse15 .cse16 .cse17 .cse18)) (or .cse0 .cse6 .cse1 .cse9 .cse2 .cse10 .cse4 .cse5 .cse19) (or .cse0 .cse8 .cse1 .cse2 .cse4 .cse5 .cse19) (or .cse0 .cse21 .cse1 .cse2 .cse4 .cse5))))) [2020-07-19 21:50:28,134 INFO L268 CegarLoopResult]: For program point L210(lines 200 238) no Hoare annotation was computed. [2020-07-19 21:50:28,135 INFO L264 CegarLoopResult]: At program point L239(lines 194 244) the Hoare annotation is: (let ((.cse2 (= 0 ~M_E~0))) (let ((.cse35 (not (= 1 ~m_pc~0))) (.cse17 (<= ~token~0 ~local~0)) (.cse20 (<= ~local~0 ~token~0)) (.cse32 (<= 2 ~m_st~0)) (.cse33 (= 0 ~m_st~0)) (.cse28 (<= 2 ~E_1~0)) (.cse29 (<= 2 ~T1_E~0)) (.cse30 (not .cse2)) (.cse18 (= 1 ~t1_pc~0)) (.cse31 (<= 2 ~E_M~0)) (.cse34 (<= 2 ~t1_st~0))) (let ((.cse23 (not (= 1 |old(~t1_pc~0)|))) (.cse9 (not (<= |old(~token~0)| |old(~local~0)|))) (.cse10 (not (<= |old(~local~0)| |old(~token~0)|))) (.cse11 (let ((.cse36 (+ ~local~0 1))) (and .cse33 .cse28 .cse29 (<= ~token~0 .cse36) (<= .cse36 ~token~0) .cse30 .cse18 .cse31 .cse34))) (.cse12 (and .cse28 .cse29 .cse17 .cse30 .cse18 .cse31 .cse20 .cse32)) (.cse24 (and .cse28 .cse29 .cse30 .cse18 .cse31 .cse34 .cse32)) (.cse22 (not (= 0 |old(~m_st~0)|))) (.cse8 (not (<= 2 |old(~t1_st~0)|))) (.cse3 (= 1 |old(~m_pc~0)|)) (.cse15 (= ~m_pc~0 |old(~m_pc~0)|)) (.cse0 (not (<= 2 |old(~E_M~0)|))) (.cse7 (not (<= |old(~t1_pc~0)| 0))) (.cse1 (not (<= 2 |old(~E_1~0)|))) (.cse4 (not .cse29)) (.cse5 (and .cse28 .cse35 .cse29 .cse30 .cse31 .cse32)) (.cse6 (not (<= 2 |old(~m_st~0)|))) (.cse27 (= |old(~t1_pc~0)| ~t1_pc~0)) (.cse13 (= ~m_st~0 |old(~m_st~0)|)) (.cse14 (= |old(~t1_st~0)| ~t1_st~0)) (.cse16 (= ~E_1~0 |old(~E_1~0)|)) (.cse26 (= ~local~0 |old(~local~0)|)) (.cse19 (= ~E_M~0 |old(~E_M~0)|)) (.cse21 (= |old(~token~0)| ~token~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse0 .cse7 .cse8 .cse1 .cse2 .cse4 .cse5 .cse6 (<= ~t1_pc~0 0)) (or .cse8 .cse9 .cse10 .cse4 .cse11 .cse0 .cse12 (and .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) .cse22 .cse2 .cse1 .cse3 .cse5 .cse23 .cse24) (let ((.cse25 (+ |old(~local~0)| 1))) (or .cse8 .cse4 .cse11 .cse0 .cse12 .cse22 (not (<= |old(~token~0)| .cse25)) .cse2 .cse1 .cse5 (not (<= .cse25 |old(~token~0)|)) .cse23 .cse24)) (or .cse11 .cse0 .cse12 .cse9 .cse2 .cse1 .cse10 .cse4 .cse5 .cse6 .cse23 .cse24) (or .cse0 .cse8 .cse1 .cse2 .cse4 .cse5 (and .cse13 .cse14 .cse16 .cse26 .cse18 .cse19 .cse21) .cse6 .cse23) (or (and .cse27 .cse13 .cse14 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21) .cse9 .cse10 .cse4 (and .cse28 .cse27 .cse29 .cse30 .cse31 .cse32) .cse11 .cse0 .cse12 .cse7 .cse22 .cse2 .cse1 .cse3 .cse5 (and .cse33 .cse28 .cse29 .cse31 .cse34 .cse21 .cse35 .cse16 .cse17 .cse30 .cse18 .cse19 .cse20) .cse24) (or .cse0 .cse7 .cse22 .cse8 .cse1 .cse2 .cse3 (and .cse28 .cse27 .cse29 .cse30 .cse31 .cse34 .cse32) .cse4 (and .cse27 .cse13 .cse14 .cse15 .cse16 .cse26 .cse19 .cse21) .cse5) (or .cse0 (and .cse16 .cse18 .cse34 .cse19 .cse32) .cse7 .cse1 .cse2 .cse4 .cse5 .cse6 (and .cse27 .cse13 .cse14 .cse16 .cse26 .cse19 .cse21)))))) [2020-07-19 21:50:28,135 INFO L268 CegarLoopResult]: For program point L227(lines 227 234) no Hoare annotation was computed. [2020-07-19 21:50:28,135 INFO L271 CegarLoopResult]: At program point L399(lines 388 401) the Hoare annotation is: true [2020-07-19 21:50:28,135 INFO L268 CegarLoopResult]: For program point L392(lines 392 397) no Hoare annotation was computed. [2020-07-19 21:50:28,135 INFO L271 CegarLoopResult]: At program point L390(line 390) the Hoare annotation is: true [2020-07-19 21:50:28,135 INFO L268 CegarLoopResult]: For program point stop_simulationEXIT(lines 384 402) no Hoare annotation was computed. [2020-07-19 21:50:28,135 INFO L268 CegarLoopResult]: For program point L390-1(line 390) no Hoare annotation was computed. [2020-07-19 21:50:28,135 INFO L271 CegarLoopResult]: At program point stop_simulationENTRY(lines 384 402) the Hoare annotation is: true [2020-07-19 21:50:28,135 INFO L268 CegarLoopResult]: For program point stop_simulationFINAL(lines 384 402) no Hoare annotation was computed. [2020-07-19 21:50:28,136 INFO L268 CegarLoopResult]: For program point update_channelsEXIT(lines 148 155) no Hoare annotation was computed. [2020-07-19 21:50:28,136 INFO L271 CegarLoopResult]: At program point update_channelsFINAL(lines 148 155) the Hoare annotation is: true [2020-07-19 21:50:28,136 INFO L264 CegarLoopResult]: At program point fire_delta_eventsENTRY(lines 245 272) the Hoare annotation is: (let ((.cse9 (not (<= ~token~0 ~local~0))) (.cse11 (not (<= ~local~0 ~token~0))) (.cse12 (not (<= ~t1_pc~0 0))) (.cse4 (= 1 ~m_pc~0)) (.cse3 (not (<= 2 ~m_st~0))) (.cse0 (and (= |old(~T1_E~0)| ~T1_E~0) (= ~M_E~0 |old(~M_E~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_M~0 |old(~E_M~0)|))) (.cse1 (not (<= 2 |old(~E_M~0)|))) (.cse7 (not (= 1 ~t1_pc~0))) (.cse8 (not (= 0 ~m_st~0))) (.cse10 (not (<= 2 ~t1_st~0))) (.cse2 (not (<= 2 |old(~E_1~0)|))) (.cse5 (not (<= 2 |old(~T1_E~0)|))) (.cse6 (= 0 |old(~M_E~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse0 .cse1 .cse7 .cse8 .cse9 .cse10 .cse2 .cse4 .cse11 .cse5 .cse6) (or .cse0 .cse1 .cse2 .cse3 .cse12 .cse5 .cse6) (or .cse0 .cse1 .cse7 .cse9 .cse2 .cse3 .cse11 .cse5 .cse6) (or .cse0 .cse1 .cse8 .cse9 .cse2 .cse12 .cse4 .cse11 .cse5 .cse6) (or .cse0 .cse1 .cse8 .cse10 .cse2 .cse12 .cse4 .cse5 .cse6) (or .cse0 .cse1 .cse7 .cse10 .cse2 .cse3 .cse5 .cse6) (let ((.cse13 (+ ~local~0 1))) (or .cse0 .cse1 .cse7 .cse8 .cse10 .cse2 (not (<= .cse13 ~token~0)) .cse5 (not (<= ~token~0 .cse13)) .cse6)))) [2020-07-19 21:50:28,136 INFO L268 CegarLoopResult]: For program point L254-1(lines 248 271) no Hoare annotation was computed. [2020-07-19 21:50:28,136 INFO L268 CegarLoopResult]: For program point L249-1(lines 248 271) no Hoare annotation was computed. [2020-07-19 21:50:28,136 INFO L268 CegarLoopResult]: For program point fire_delta_eventsEXIT(lines 245 272) no Hoare annotation was computed. [2020-07-19 21:50:28,137 INFO L268 CegarLoopResult]: For program point L264-1(lines 245 272) no Hoare annotation was computed. [2020-07-19 21:50:28,137 INFO L268 CegarLoopResult]: For program point L259-1(lines 248 271) no Hoare annotation was computed. [2020-07-19 21:50:28,137 INFO L268 CegarLoopResult]: For program point L448(line 448) no Hoare annotation was computed. [2020-07-19 21:50:28,137 INFO L264 CegarLoopResult]: At program point L413(line 413) the Hoare annotation is: (let ((.cse0 (= 0 ~m_st~0)) (.cse1 (= |old(~t1_pc~0)| ~t1_pc~0)) (.cse2 (not (= 1 ~m_pc~0))) (.cse3 (= |old(~T1_E~0)| ~T1_E~0)) (.cse4 (= ~M_E~0 |old(~M_E~0)|)) (.cse5 (= ~E_1~0 |old(~E_1~0)|)) (.cse6 (= ~E_M~0 |old(~E_M~0)|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ~token~0 ~local~0) .cse6 (<= ~local~0 ~token~0) (= |old(~token~0)| ~token~0)) (not (<= 2 |old(~E_M~0)|)) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (<= 2 |old(~E_1~0)|)) (not (<= |old(~token~0)| |old(~local~0)|)) (and .cse2 .cse4 .cse3 .cse5 .cse6 (<= 2 ~m_st~0)) (= 1 |old(~m_pc~0)|) (not (<= |old(~local~0)| |old(~token~0)|)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= 2 ~t1_st~0) .cse6) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|)))) [2020-07-19 21:50:28,137 INFO L264 CegarLoopResult]: At program point L411(line 411) the Hoare annotation is: (or (and (= |old(~t1_pc~0)| ~t1_pc~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t1_st~0)| ~t1_st~0) (= ~m_pc~0 |old(~m_pc~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~M_E~0 |old(~M_E~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~local~0 |old(~local~0)|) (<= ~token~0 ~local~0) (= ~E_M~0 |old(~E_M~0)|) (<= ~local~0 ~token~0)) (not (<= 2 |old(~E_M~0)|)) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (<= 2 |old(~E_1~0)|)) (not (<= |old(~token~0)| |old(~local~0)|)) (= 1 |old(~m_pc~0)|) (not (<= |old(~local~0)| |old(~token~0)|)) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|))) [2020-07-19 21:50:28,137 INFO L268 CegarLoopResult]: For program point start_simulationEXIT(lines 403 461) no Hoare annotation was computed. [2020-07-19 21:50:28,138 INFO L264 CegarLoopResult]: At program point L411-1(line 411) the Hoare annotation is: (or (and (= |old(~t1_pc~0)| ~t1_pc~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t1_st~0)| ~t1_st~0) (= ~m_pc~0 |old(~m_pc~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~M_E~0 |old(~M_E~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~local~0 |old(~local~0)|) (<= ~token~0 ~local~0) (= ~E_M~0 |old(~E_M~0)|) (<= ~local~0 ~token~0)) (not (<= 2 |old(~E_M~0)|)) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (<= 2 |old(~E_1~0)|)) (not (<= |old(~token~0)| |old(~local~0)|)) (= 1 |old(~m_pc~0)|) (not (<= |old(~local~0)| |old(~token~0)|)) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|))) [2020-07-19 21:50:28,138 INFO L264 CegarLoopResult]: At program point L440(line 440) the Hoare annotation is: (let ((.cse6 (= 1 ~t1_pc~0)) (.cse14 (<= 2 ~m_st~0)) (.cse8 (<= 2 ~t1_st~0)) (.cse0 (= 0 ~m_st~0)) (.cse1 (<= 2 ~E_1~0)) (.cse13 (= |old(~t1_pc~0)| ~t1_pc~0)) (.cse9 (not (= 1 ~m_pc~0))) (.cse2 (= |old(~T1_E~0)| ~T1_E~0)) (.cse3 (<= 2 ~T1_E~0)) (.cse10 (<= ~token~0 ~local~0)) (.cse5 (not (= 0 ~M_E~0))) (.cse7 (<= 2 ~E_M~0)) (.cse11 (<= ~local~0 ~token~0)) (.cse15 (<= ~t1_pc~0 0)) (.cse12 (= |old(~token~0)| ~token~0))) (or (let ((.cse4 (+ ~local~0 1))) (and .cse0 .cse1 .cse2 .cse3 (<= ~token~0 .cse4) (<= .cse4 ~token~0) .cse5 .cse6 .cse7 .cse8)) (and .cse0 .cse1 .cse9 .cse2 .cse3 .cse10 .cse5 .cse6 .cse7 .cse8 .cse11 .cse12) (and .cse1 .cse13 .cse2 .cse3 .cse5 .cse7 .cse14) (and .cse1 .cse9 .cse2 .cse3 .cse5 .cse7 .cse14) (not (<= |old(~token~0)| |old(~local~0)|)) (not (<= |old(~local~0)| |old(~token~0)|)) (not (<= 2 |old(~E_M~0)|)) (and .cse1 .cse2 .cse3 .cse10 .cse5 .cse6 .cse7 .cse11 .cse14) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (and .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse14) (and .cse0 .cse1 .cse13 .cse9 .cse2 .cse3 .cse5 .cse7 .cse8 .cse15) (and .cse0 .cse1 .cse13 .cse9 .cse2 .cse3 .cse10 .cse5 .cse7 .cse11 .cse15 .cse12) (not (<= 2 |old(~E_1~0)|)) (= 1 |old(~m_pc~0)|) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|)))) [2020-07-19 21:50:28,138 INFO L264 CegarLoopResult]: At program point L440-1(line 440) the Hoare annotation is: (let ((.cse9 (<= 2 ~t1_st~0)) (.cse8 (= 1 ~t1_pc~0)) (.cse5 (<= 2 ~m_st~0)) (.cse6 (= 0 ~m_st~0)) (.cse0 (<= 2 ~E_1~0)) (.cse1 (= |old(~t1_pc~0)| ~t1_pc~0)) (.cse10 (not (= 1 ~m_pc~0))) (.cse2 (= |old(~T1_E~0)| ~T1_E~0)) (.cse11 (<= ~token~0 ~local~0)) (.cse3 (not (= 0 ~M_E~0))) (.cse4 (<= 2 ~E_M~0)) (.cse12 (<= ~local~0 ~token~0)) (.cse13 (= |old(~token~0)| ~token~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (let ((.cse7 (+ ~local~0 1))) (and .cse6 .cse0 .cse2 (<= ~token~0 .cse7) (<= .cse7 ~token~0) .cse3 .cse8 .cse4 .cse9)) (not (<= |old(~token~0)| |old(~local~0)|)) (not (<= |old(~local~0)| |old(~token~0)|)) (and .cse0 .cse10 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse2 .cse3 .cse8 .cse4 .cse9 .cse5) (and .cse6 .cse0 .cse10 .cse2 .cse11 .cse3 .cse8 .cse4 .cse9 .cse12 .cse13) (and .cse6 .cse0 .cse1 .cse10 .cse2 .cse3 .cse4 .cse9) (not (<= 2 |old(~E_M~0)|)) (and .cse0 .cse2 .cse11 .cse3 .cse8 .cse4 .cse12 .cse5) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (<= 2 |old(~E_1~0)|)) (= 1 |old(~m_pc~0)|) (and .cse6 .cse0 .cse1 .cse10 .cse2 .cse11 .cse3 .cse4 .cse12 .cse13) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|)))) [2020-07-19 21:50:28,139 INFO L264 CegarLoopResult]: At program point L432(line 432) the Hoare annotation is: (let ((.cse9 (<= 2 ~t1_st~0)) (.cse8 (= 1 ~t1_pc~0)) (.cse5 (<= 2 ~m_st~0)) (.cse6 (= 0 ~m_st~0)) (.cse0 (<= 2 ~E_1~0)) (.cse1 (= |old(~t1_pc~0)| ~t1_pc~0)) (.cse10 (not (= 1 ~m_pc~0))) (.cse2 (= |old(~T1_E~0)| ~T1_E~0)) (.cse11 (<= ~token~0 ~local~0)) (.cse3 (not (= 0 ~M_E~0))) (.cse4 (<= 2 ~E_M~0)) (.cse12 (<= ~local~0 ~token~0)) (.cse13 (= |old(~token~0)| ~token~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (let ((.cse7 (+ ~local~0 1))) (and .cse6 .cse0 .cse2 (<= ~token~0 .cse7) (<= .cse7 ~token~0) .cse3 .cse8 .cse4 .cse9)) (not (<= |old(~token~0)| |old(~local~0)|)) (and .cse0 .cse10 .cse2 .cse3 .cse4 .cse5) (not (<= |old(~local~0)| |old(~token~0)|)) (and .cse0 .cse2 .cse3 .cse8 .cse4 .cse9 .cse5) (and .cse6 .cse0 .cse10 .cse2 .cse11 .cse3 .cse8 .cse4 .cse9 .cse12 .cse13) (not (<= 2 |old(~E_M~0)|)) (and .cse6 .cse0 .cse1 .cse10 .cse2 .cse3 .cse4 .cse9) (and .cse0 .cse2 .cse11 .cse3 .cse8 .cse4 .cse12 .cse5) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (<= 2 |old(~E_1~0)|)) (= 1 |old(~m_pc~0)|) (and .cse6 .cse0 .cse1 .cse10 .cse2 .cse11 .cse3 .cse4 .cse12 .cse13) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|)))) [2020-07-19 21:50:28,139 INFO L264 CegarLoopResult]: At program point L430(line 430) the Hoare annotation is: (let ((.cse9 (<= 2 ~t1_st~0)) (.cse8 (= 1 ~t1_pc~0)) (.cse5 (<= 2 ~m_st~0)) (.cse6 (= 0 ~m_st~0)) (.cse0 (<= 2 ~E_1~0)) (.cse1 (= |old(~t1_pc~0)| ~t1_pc~0)) (.cse10 (not (= 1 ~m_pc~0))) (.cse2 (= |old(~T1_E~0)| ~T1_E~0)) (.cse11 (<= ~token~0 ~local~0)) (.cse3 (not (= 0 ~M_E~0))) (.cse4 (<= 2 ~E_M~0)) (.cse12 (<= ~local~0 ~token~0)) (.cse13 (= |old(~token~0)| ~token~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (let ((.cse7 (+ ~local~0 1))) (and .cse6 .cse0 .cse2 (<= ~token~0 .cse7) (<= .cse7 ~token~0) .cse3 .cse8 .cse4 .cse9)) (not (<= |old(~token~0)| |old(~local~0)|)) (and .cse0 .cse10 .cse2 .cse3 .cse4 .cse5) (not (<= |old(~local~0)| |old(~token~0)|)) (and .cse0 .cse2 .cse3 .cse8 .cse4 .cse9 .cse5) (and .cse6 .cse0 .cse10 .cse2 .cse11 .cse3 .cse8 .cse4 .cse9 .cse12 .cse13) (not (<= 2 |old(~E_M~0)|)) (and .cse6 .cse0 .cse1 .cse10 .cse2 .cse3 .cse4 .cse9) (and .cse0 .cse2 .cse11 .cse3 .cse8 .cse4 .cse12 .cse5) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (<= 2 |old(~E_1~0)|)) (= 1 |old(~m_pc~0)|) (and .cse6 .cse0 .cse1 .cse10 .cse2 .cse11 .cse3 .cse4 .cse12 .cse13) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|)))) [2020-07-19 21:50:28,139 INFO L264 CegarLoopResult]: At program point L430-1(line 430) the Hoare annotation is: (let ((.cse9 (<= 2 ~t1_st~0)) (.cse8 (= 1 ~t1_pc~0)) (.cse5 (<= 2 ~m_st~0)) (.cse6 (= 0 ~m_st~0)) (.cse0 (<= 2 ~E_1~0)) (.cse1 (= |old(~t1_pc~0)| ~t1_pc~0)) (.cse10 (not (= 1 ~m_pc~0))) (.cse2 (= |old(~T1_E~0)| ~T1_E~0)) (.cse11 (<= ~token~0 ~local~0)) (.cse3 (not (= 0 ~M_E~0))) (.cse4 (<= 2 ~E_M~0)) (.cse12 (<= ~local~0 ~token~0)) (.cse13 (= |old(~token~0)| ~token~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (let ((.cse7 (+ ~local~0 1))) (and .cse6 .cse0 .cse2 (<= ~token~0 .cse7) (<= .cse7 ~token~0) .cse3 .cse8 .cse4 .cse9)) (not (<= |old(~token~0)| |old(~local~0)|)) (and .cse0 .cse10 .cse2 .cse3 .cse4 .cse5) (not (<= |old(~local~0)| |old(~token~0)|)) (and .cse0 .cse2 .cse3 .cse8 .cse4 .cse9 .cse5) (and .cse6 .cse0 .cse10 .cse2 .cse11 .cse3 .cse8 .cse4 .cse9 .cse12 .cse13) (not (<= 2 |old(~E_M~0)|)) (and .cse6 .cse0 .cse1 .cse10 .cse2 .cse3 .cse4 .cse9) (and .cse0 .cse2 .cse11 .cse3 .cse8 .cse4 .cse12 .cse5) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (<= 2 |old(~E_1~0)|)) (= 1 |old(~m_pc~0)|) (and .cse6 .cse0 .cse1 .cse10 .cse2 .cse11 .cse3 .cse4 .cse12 .cse13) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|)))) [2020-07-19 21:50:28,139 INFO L264 CegarLoopResult]: At program point L426(line 426) the Hoare annotation is: (let ((.cse9 (<= 2 ~t1_st~0)) (.cse8 (= 1 ~t1_pc~0)) (.cse5 (<= 2 ~m_st~0)) (.cse6 (= 0 ~m_st~0)) (.cse0 (<= 2 ~E_1~0)) (.cse1 (= |old(~t1_pc~0)| ~t1_pc~0)) (.cse10 (not (= 1 ~m_pc~0))) (.cse2 (= |old(~T1_E~0)| ~T1_E~0)) (.cse11 (<= ~token~0 ~local~0)) (.cse3 (not (= 0 ~M_E~0))) (.cse4 (<= 2 ~E_M~0)) (.cse12 (<= ~local~0 ~token~0)) (.cse13 (= |old(~token~0)| ~token~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (let ((.cse7 (+ ~local~0 1))) (and .cse6 .cse0 .cse2 (<= ~token~0 .cse7) (<= .cse7 ~token~0) .cse3 .cse8 .cse4 .cse9)) (not (<= |old(~token~0)| |old(~local~0)|)) (and .cse0 .cse10 .cse2 .cse3 .cse4 .cse5) (not (<= |old(~local~0)| |old(~token~0)|)) (and .cse0 .cse2 .cse3 .cse8 .cse4 .cse9 .cse5) (and .cse6 .cse0 .cse10 .cse2 .cse11 .cse3 .cse8 .cse4 .cse9 .cse12 .cse13) (not (<= 2 |old(~E_M~0)|)) (and .cse6 .cse0 .cse1 .cse10 .cse2 .cse3 .cse4 .cse9) (and .cse0 .cse2 .cse11 .cse3 .cse8 .cse4 .cse12 .cse5) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (<= 2 |old(~E_1~0)|)) (= 1 |old(~m_pc~0)|) (and .cse6 .cse0 .cse1 .cse10 .cse2 .cse11 .cse3 .cse4 .cse12 .cse13) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|)))) [2020-07-19 21:50:28,140 INFO L268 CegarLoopResult]: For program point L426-1(line 426) no Hoare annotation was computed. [2020-07-19 21:50:28,140 INFO L264 CegarLoopResult]: At program point L422(line 422) the Hoare annotation is: (let ((.cse9 (<= 2 ~t1_st~0)) (.cse8 (= 1 ~t1_pc~0)) (.cse5 (<= 2 ~m_st~0)) (.cse6 (= 0 ~m_st~0)) (.cse0 (<= 2 ~E_1~0)) (.cse1 (= |old(~t1_pc~0)| ~t1_pc~0)) (.cse10 (not (= 1 ~m_pc~0))) (.cse2 (= |old(~T1_E~0)| ~T1_E~0)) (.cse11 (<= ~token~0 ~local~0)) (.cse3 (not (= 0 ~M_E~0))) (.cse4 (<= 2 ~E_M~0)) (.cse12 (<= ~local~0 ~token~0)) (.cse13 (= |old(~token~0)| ~token~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (let ((.cse7 (+ ~local~0 1))) (and .cse6 .cse0 .cse2 (<= ~token~0 .cse7) (<= .cse7 ~token~0) .cse3 .cse8 .cse4 .cse9)) (not (<= |old(~token~0)| |old(~local~0)|)) (and .cse0 .cse10 .cse2 .cse3 .cse4 .cse5) (not (<= |old(~local~0)| |old(~token~0)|)) (and .cse0 .cse2 .cse3 .cse8 .cse4 .cse9 .cse5) (and .cse6 .cse0 .cse10 .cse2 .cse11 .cse3 .cse8 .cse4 .cse9 .cse12 .cse13) (not (<= 2 |old(~E_M~0)|)) (and .cse6 .cse0 .cse1 .cse10 .cse2 .cse3 .cse4 .cse9) (and .cse0 .cse2 .cse11 .cse3 .cse8 .cse4 .cse12 .cse5) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (<= 2 |old(~E_1~0)|)) (= 1 |old(~m_pc~0)|) (and .cse6 .cse0 .cse1 .cse10 .cse2 .cse11 .cse3 .cse4 .cse12 .cse13) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|)))) [2020-07-19 21:50:28,140 INFO L268 CegarLoopResult]: For program point L422-1(line 422) no Hoare annotation was computed. [2020-07-19 21:50:28,140 INFO L264 CegarLoopResult]: At program point L418-1(lines 415 455) the Hoare annotation is: (let ((.cse9 (<= 2 ~t1_st~0)) (.cse8 (= 1 ~t1_pc~0)) (.cse5 (<= 2 ~m_st~0)) (.cse6 (= 0 ~m_st~0)) (.cse0 (<= 2 ~E_1~0)) (.cse1 (= |old(~t1_pc~0)| ~t1_pc~0)) (.cse10 (not (= 1 ~m_pc~0))) (.cse2 (= |old(~T1_E~0)| ~T1_E~0)) (.cse11 (<= ~token~0 ~local~0)) (.cse3 (not (= 0 ~M_E~0))) (.cse4 (<= 2 ~E_M~0)) (.cse12 (<= ~local~0 ~token~0)) (.cse13 (= |old(~token~0)| ~token~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (let ((.cse7 (+ ~local~0 1))) (and .cse6 .cse0 .cse2 (<= ~token~0 .cse7) (<= .cse7 ~token~0) .cse3 .cse8 .cse4 .cse9)) (not (<= |old(~token~0)| |old(~local~0)|)) (and .cse0 .cse10 .cse2 .cse3 .cse4 .cse5) (not (<= |old(~local~0)| |old(~token~0)|)) (and .cse0 .cse2 .cse3 .cse8 .cse4 .cse9 .cse5) (and .cse6 .cse0 .cse10 .cse2 .cse11 .cse3 .cse8 .cse4 .cse9 .cse12 .cse13) (not (<= 2 |old(~E_M~0)|)) (and .cse6 .cse0 .cse1 .cse10 .cse2 .cse3 .cse4 .cse9) (and .cse0 .cse2 .cse11 .cse3 .cse8 .cse4 .cse12 .cse5) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (<= 2 |old(~E_1~0)|)) (= 1 |old(~m_pc~0)|) (and .cse6 .cse0 .cse1 .cse10 .cse2 .cse11 .cse3 .cse4 .cse12 .cse13) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|)))) [2020-07-19 21:50:28,141 INFO L264 CegarLoopResult]: At program point start_simulationENTRY(lines 403 461) the Hoare annotation is: (or (and (= |old(~t1_pc~0)| ~t1_pc~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t1_st~0)| ~t1_st~0) (= ~m_pc~0 |old(~m_pc~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~M_E~0 |old(~M_E~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~local~0 |old(~local~0)|) (<= ~token~0 ~local~0) (= ~E_M~0 |old(~E_M~0)|) (<= ~local~0 ~token~0)) (not (<= 2 |old(~E_M~0)|)) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (<= 2 |old(~E_1~0)|)) (not (<= |old(~token~0)| |old(~local~0)|)) (= 1 |old(~m_pc~0)|) (not (<= |old(~local~0)| |old(~token~0)|)) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|))) [2020-07-19 21:50:28,141 INFO L264 CegarLoopResult]: At program point L414(line 414) the Hoare annotation is: (let ((.cse0 (= 0 ~m_st~0)) (.cse1 (= |old(~t1_pc~0)| ~t1_pc~0)) (.cse2 (not (= 1 ~m_pc~0))) (.cse3 (= |old(~T1_E~0)| ~T1_E~0)) (.cse4 (= ~M_E~0 |old(~M_E~0)|)) (.cse5 (= ~E_1~0 |old(~E_1~0)|)) (.cse6 (= ~E_M~0 |old(~E_M~0)|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ~token~0 ~local~0) .cse6 (<= ~local~0 ~token~0) (= |old(~token~0)| ~token~0)) (not (<= 2 |old(~E_M~0)|)) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (<= 2 |old(~E_1~0)|)) (not (<= |old(~token~0)| |old(~local~0)|)) (and .cse2 .cse4 .cse3 .cse5 .cse6 (<= 2 ~m_st~0)) (= 1 |old(~m_pc~0)|) (not (<= |old(~local~0)| |old(~token~0)|)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= 2 ~t1_st~0) .cse6) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|)))) [2020-07-19 21:50:28,141 INFO L264 CegarLoopResult]: At program point L412(line 412) the Hoare annotation is: (let ((.cse0 (= 0 ~m_st~0)) (.cse1 (= |old(~t1_pc~0)| ~t1_pc~0)) (.cse2 (not (= 1 ~m_pc~0))) (.cse3 (= |old(~T1_E~0)| ~T1_E~0)) (.cse4 (= ~M_E~0 |old(~M_E~0)|)) (.cse5 (= ~E_1~0 |old(~E_1~0)|)) (.cse6 (= ~E_M~0 |old(~E_M~0)|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ~token~0 ~local~0) .cse6 (<= ~local~0 ~token~0) (= |old(~token~0)| ~token~0)) (not (<= 2 |old(~E_M~0)|)) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (and .cse2 .cse4 .cse3 .cse5 .cse6 (<= 2 ~m_st~0)) (not (<= 2 |old(~E_1~0)|)) (not (<= |old(~token~0)| |old(~local~0)|)) (= 1 |old(~m_pc~0)|) (not (<= |old(~local~0)| |old(~token~0)|)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= 2 ~t1_st~0) .cse6) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|)))) [2020-07-19 21:50:28,141 INFO L264 CegarLoopResult]: At program point L441(line 441) the Hoare annotation is: (let ((.cse9 (<= 2 ~t1_st~0)) (.cse8 (= 1 ~t1_pc~0)) (.cse5 (<= 2 ~m_st~0)) (.cse6 (= 0 ~m_st~0)) (.cse0 (<= 2 ~E_1~0)) (.cse1 (= |old(~t1_pc~0)| ~t1_pc~0)) (.cse10 (not (= 1 ~m_pc~0))) (.cse2 (= |old(~T1_E~0)| ~T1_E~0)) (.cse11 (<= ~token~0 ~local~0)) (.cse3 (not (= 0 ~M_E~0))) (.cse4 (<= 2 ~E_M~0)) (.cse12 (<= ~local~0 ~token~0)) (.cse13 (= |old(~token~0)| ~token~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (let ((.cse7 (+ ~local~0 1))) (and .cse6 .cse0 .cse2 (<= ~token~0 .cse7) (<= .cse7 ~token~0) .cse3 .cse8 .cse4 .cse9)) (not (<= |old(~token~0)| |old(~local~0)|)) (not (<= |old(~local~0)| |old(~token~0)|)) (and .cse0 .cse10 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse2 .cse3 .cse8 .cse4 .cse9 .cse5) (and .cse6 .cse0 .cse10 .cse2 .cse11 .cse3 .cse8 .cse4 .cse9 .cse12 .cse13) (and .cse6 .cse0 .cse1 .cse10 .cse2 .cse3 .cse4 .cse9) (not (<= 2 |old(~E_M~0)|)) (and .cse0 .cse2 .cse11 .cse3 .cse8 .cse4 .cse12 .cse5) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (<= 2 |old(~E_1~0)|)) (= 1 |old(~m_pc~0)|) (and .cse6 .cse0 .cse1 .cse10 .cse2 .cse11 .cse3 .cse4 .cse12 .cse13) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|)))) [2020-07-19 21:50:28,142 INFO L268 CegarLoopResult]: For program point L437(lines 437 446) no Hoare annotation was computed. [2020-07-19 21:50:28,142 INFO L264 CegarLoopResult]: At program point L437-1(lines 437 446) the Hoare annotation is: (let ((.cse9 (<= 2 ~t1_st~0)) (.cse8 (= 1 ~t1_pc~0)) (.cse5 (<= 2 ~m_st~0)) (.cse6 (= 0 ~m_st~0)) (.cse0 (<= 2 ~E_1~0)) (.cse1 (= |old(~t1_pc~0)| ~t1_pc~0)) (.cse10 (not (= 1 ~m_pc~0))) (.cse2 (= |old(~T1_E~0)| ~T1_E~0)) (.cse11 (<= ~token~0 ~local~0)) (.cse3 (not (= 0 ~M_E~0))) (.cse4 (<= 2 ~E_M~0)) (.cse12 (<= ~local~0 ~token~0)) (.cse13 (= |old(~token~0)| ~token~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (let ((.cse7 (+ ~local~0 1))) (and .cse6 .cse0 .cse2 (<= ~token~0 .cse7) (<= .cse7 ~token~0) .cse3 .cse8 .cse4 .cse9)) (not (<= |old(~token~0)| |old(~local~0)|)) (and .cse0 .cse10 .cse2 .cse3 .cse4 .cse5) (not (<= |old(~local~0)| |old(~token~0)|)) (and .cse0 .cse2 .cse3 .cse8 .cse4 .cse9 .cse5) (and .cse6 .cse0 .cse10 .cse2 .cse11 .cse3 .cse8 .cse4 .cse9 .cse12 .cse13) (not (<= 2 |old(~E_M~0)|)) (and .cse6 .cse0 .cse1 .cse10 .cse2 .cse3 .cse4 .cse9) (and .cse0 .cse2 .cse11 .cse3 .cse8 .cse4 .cse12 .cse5) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (<= 2 |old(~E_1~0)|)) (= 1 |old(~m_pc~0)|) (and .cse6 .cse0 .cse1 .cse10 .cse2 .cse11 .cse3 .cse4 .cse12 .cse13) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|)))) [2020-07-19 21:50:28,142 INFO L268 CegarLoopResult]: For program point L435(line 435) no Hoare annotation was computed. [2020-07-19 21:50:28,142 INFO L264 CegarLoopResult]: At program point L431(line 431) the Hoare annotation is: (let ((.cse9 (<= 2 ~t1_st~0)) (.cse8 (= 1 ~t1_pc~0)) (.cse5 (<= 2 ~m_st~0)) (.cse6 (= 0 ~m_st~0)) (.cse0 (<= 2 ~E_1~0)) (.cse1 (= |old(~t1_pc~0)| ~t1_pc~0)) (.cse10 (not (= 1 ~m_pc~0))) (.cse2 (= |old(~T1_E~0)| ~T1_E~0)) (.cse11 (<= ~token~0 ~local~0)) (.cse3 (not (= 0 ~M_E~0))) (.cse4 (<= 2 ~E_M~0)) (.cse12 (<= ~local~0 ~token~0)) (.cse13 (= |old(~token~0)| ~token~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (let ((.cse7 (+ ~local~0 1))) (and .cse6 .cse0 .cse2 (<= ~token~0 .cse7) (<= .cse7 ~token~0) .cse3 .cse8 .cse4 .cse9)) (not (<= |old(~token~0)| |old(~local~0)|)) (and .cse0 .cse10 .cse2 .cse3 .cse4 .cse5) (not (<= |old(~local~0)| |old(~token~0)|)) (and .cse0 .cse2 .cse3 .cse8 .cse4 .cse9 .cse5) (and .cse6 .cse0 .cse10 .cse2 .cse11 .cse3 .cse8 .cse4 .cse9 .cse12 .cse13) (not (<= 2 |old(~E_M~0)|)) (and .cse6 .cse0 .cse1 .cse10 .cse2 .cse3 .cse4 .cse9) (and .cse0 .cse2 .cse11 .cse3 .cse8 .cse4 .cse12 .cse5) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (<= 2 |old(~E_1~0)|)) (= 1 |old(~m_pc~0)|) (and .cse6 .cse0 .cse1 .cse10 .cse2 .cse11 .cse3 .cse4 .cse12 .cse13) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|)))) [2020-07-19 21:50:28,142 INFO L264 CegarLoopResult]: At program point L456(lines 403 461) the Hoare annotation is: (or (not (<= 2 |old(~E_M~0)|)) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (<= 2 |old(~E_1~0)|)) (not (<= |old(~token~0)| |old(~local~0)|)) (= 1 |old(~m_pc~0)|) (not (<= |old(~local~0)| |old(~token~0)|)) (not (= 0 ~M_E~0)) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|))) [2020-07-19 21:50:28,143 INFO L268 CegarLoopResult]: For program point L419(line 419) no Hoare annotation was computed. [2020-07-19 21:50:28,143 INFO L268 CegarLoopResult]: For program point L450(lines 450 454) no Hoare annotation was computed. [2020-07-19 21:50:28,143 INFO L264 CegarLoopResult]: At program point L125(lines 113 127) the Hoare annotation is: (let ((.cse15 (+ ~local~0 1))) (let ((.cse10 (not (<= ~t1_pc~0 0))) (.cse6 (not (<= .cse15 ~token~0))) (.cse8 (not (<= ~token~0 .cse15))) (.cse1 (not (= 1 ~t1_pc~0))) (.cse13 (not (<= ~token~0 ~local~0))) (.cse2 (not (<= 2 ~E_M~0))) (.cse3 (not (<= 2 ~t1_st~0))) (.cse12 (= 0 ~E_1~0)) (.cse14 (not (<= ~local~0 ~token~0))) (.cse0 (not (<= 2 ~E_1~0))) (.cse9 (not (<= 2 ~m_st~0))) (.cse4 (= 0 ~M_E~0)) (.cse5 (not (<= 2 ~T1_E~0))) (.cse11 (= 1 ~m_pc~0)) (.cse7 (and (<= 0 is_master_triggered_~__retres1~0) (<= is_master_triggered_~__retres1~0 0)))) (and (or .cse0 .cse1 (not (= 0 ~m_st~0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse0 .cse2 .cse9 .cse4 .cse5 .cse10 .cse7) (or .cse0 .cse1 .cse2 .cse3 .cse9 .cse4 .cse5 .cse7) (or .cse2 .cse4 .cse5 .cse10 .cse11 .cse12 .cse7) (or .cse0 .cse1 (= 1 ~E_M~0) .cse9 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse0 .cse1 .cse13 .cse2 .cse9 .cse4 .cse5 .cse14 .cse7) (or .cse1 .cse13 .cse2 .cse3 .cse4 .cse5 .cse12 .cse7 .cse14) (or .cse0 .cse9 .cse4 .cse5 .cse11 .cse7)))) [2020-07-19 21:50:28,143 INFO L268 CegarLoopResult]: For program point is_master_triggeredFINAL(lines 110 128) no Hoare annotation was computed. [2020-07-19 21:50:28,143 INFO L268 CegarLoopResult]: For program point L115(lines 115 120) no Hoare annotation was computed. [2020-07-19 21:50:28,143 INFO L268 CegarLoopResult]: For program point L114(lines 114 123) no Hoare annotation was computed. [2020-07-19 21:50:28,143 INFO L268 CegarLoopResult]: For program point L114-2(lines 114 123) no Hoare annotation was computed. [2020-07-19 21:50:28,144 INFO L268 CegarLoopResult]: For program point is_master_triggeredEXIT(lines 110 128) no Hoare annotation was computed. [2020-07-19 21:50:28,144 INFO L271 CegarLoopResult]: At program point is_master_triggeredENTRY(lines 110 128) the Hoare annotation is: true [2020-07-19 21:50:28,144 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-19 21:50:28,144 INFO L264 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: (and (<= 2 ~E_1~0) (= 0 ~m_st~0) (not (= 1 ~m_pc~0)) (<= 2 ~T1_E~0) (<= ~token~0 ~local~0) (<= 2 ~E_M~0) (<= 2 ~M_E~0) (<= ~local~0 ~token~0) (<= ~t1_pc~0 0)) [2020-07-19 21:50:28,144 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-19 21:50:28,144 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-19 21:50:28,144 INFO L268 CegarLoopResult]: For program point reset_time_eventsEXIT(lines 346 373) no Hoare annotation was computed. [2020-07-19 21:50:28,145 INFO L268 CegarLoopResult]: For program point L350-1(lines 349 372) no Hoare annotation was computed. [2020-07-19 21:50:28,145 INFO L264 CegarLoopResult]: At program point reset_time_eventsENTRY(lines 346 373) the Hoare annotation is: (let ((.cse9 (not (<= ~token~0 ~local~0))) (.cse11 (not (<= ~local~0 ~token~0))) (.cse12 (not (<= ~t1_pc~0 0))) (.cse4 (= 1 ~m_pc~0)) (.cse3 (not (<= 2 ~m_st~0))) (.cse0 (and (= |old(~T1_E~0)| ~T1_E~0) (= ~M_E~0 |old(~M_E~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_M~0 |old(~E_M~0)|))) (.cse1 (not (<= 2 |old(~E_M~0)|))) (.cse7 (not (= 1 ~t1_pc~0))) (.cse8 (not (= 0 ~m_st~0))) (.cse10 (not (<= 2 ~t1_st~0))) (.cse2 (not (<= 2 |old(~E_1~0)|))) (.cse5 (not (<= 2 |old(~T1_E~0)|))) (.cse6 (= 0 |old(~M_E~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse0 .cse1 .cse7 .cse8 .cse9 .cse10 .cse2 .cse4 .cse11 .cse5 .cse6) (or .cse0 .cse1 .cse2 .cse3 .cse12 .cse5 .cse6) (or .cse0 .cse1 .cse7 .cse9 .cse2 .cse3 .cse11 .cse5 .cse6) (or .cse0 .cse1 .cse8 .cse9 .cse2 .cse12 .cse4 .cse11 .cse5 .cse6) (or .cse0 .cse1 .cse8 .cse10 .cse2 .cse12 .cse4 .cse5 .cse6) (or .cse0 .cse1 .cse7 .cse10 .cse2 .cse3 .cse5 .cse6) (let ((.cse13 (+ ~local~0 1))) (or .cse0 .cse1 .cse7 .cse8 .cse10 .cse2 (not (<= .cse13 ~token~0)) .cse5 (not (<= ~token~0 .cse13)) .cse6)))) [2020-07-19 21:50:28,145 INFO L268 CegarLoopResult]: For program point L365-1(lines 346 373) no Hoare annotation was computed. [2020-07-19 21:50:28,145 INFO L268 CegarLoopResult]: For program point L360-1(lines 349 372) no Hoare annotation was computed. [2020-07-19 21:50:28,145 INFO L268 CegarLoopResult]: For program point L355-1(lines 349 372) no Hoare annotation was computed. [2020-07-19 21:50:28,145 INFO L268 CegarLoopResult]: For program point init_modelFINAL(lines 374 383) no Hoare annotation was computed. [2020-07-19 21:50:28,145 INFO L268 CegarLoopResult]: For program point init_modelEXIT(lines 374 383) no Hoare annotation was computed. [2020-07-19 21:50:28,146 INFO L264 CegarLoopResult]: At program point init_modelENTRY(lines 374 383) the Hoare annotation is: (or (not (<= 2 ~E_1~0)) (not (= 0 ~m_st~0)) (not (<= ~token~0 ~local~0)) (and (= ~t1_i~0 |old(~t1_i~0)|) (= |old(~m_i~0)| ~m_i~0)) (not (<= 2 ~E_M~0)) (not (<= 2 ~M_E~0)) (not (<= 2 ~T1_E~0)) (not (<= ~t1_pc~0 0)) (= 1 ~m_pc~0) (not (<= ~local~0 ~token~0))) [2020-07-19 21:50:28,203 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.07 09:50:28 BoogieIcfgContainer [2020-07-19 21:50:28,204 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-19 21:50:28,205 INFO L168 Benchmark]: Toolchain (without parser) took 64571.28 ms. Allocated memory was 141.6 MB in the beginning and 853.0 MB in the end (delta: 711.5 MB). Free memory was 104.1 MB in the beginning and 671.9 MB in the end (delta: -567.7 MB). Peak memory consumption was 737.9 MB. Max. memory is 7.1 GB. [2020-07-19 21:50:28,206 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 141.6 MB. Free memory was 122.5 MB in the beginning and 122.3 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-19 21:50:28,207 INFO L168 Benchmark]: CACSL2BoogieTranslator took 481.07 ms. Allocated memory was 141.6 MB in the beginning and 203.9 MB in the end (delta: 62.4 MB). Free memory was 103.7 MB in the beginning and 180.6 MB in the end (delta: -76.8 MB). Peak memory consumption was 22.3 MB. Max. memory is 7.1 GB. [2020-07-19 21:50:28,207 INFO L168 Benchmark]: Boogie Preprocessor took 42.41 ms. Allocated memory is still 203.9 MB. Free memory was 180.6 MB in the beginning and 177.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2020-07-19 21:50:28,208 INFO L168 Benchmark]: RCFGBuilder took 557.52 ms. Allocated memory is still 203.9 MB. Free memory was 177.9 MB in the beginning and 147.2 MB in the end (delta: 30.7 MB). Peak memory consumption was 30.7 MB. Max. memory is 7.1 GB. [2020-07-19 21:50:28,208 INFO L168 Benchmark]: TraceAbstraction took 63482.22 ms. Allocated memory was 203.9 MB in the beginning and 853.0 MB in the end (delta: 649.1 MB). Free memory was 146.6 MB in the beginning and 671.9 MB in the end (delta: -525.3 MB). Peak memory consumption was 718.0 MB. Max. memory is 7.1 GB. [2020-07-19 21:50:28,211 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 141.6 MB. Free memory was 122.5 MB in the beginning and 122.3 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 481.07 ms. Allocated memory was 141.6 MB in the beginning and 203.9 MB in the end (delta: 62.4 MB). Free memory was 103.7 MB in the beginning and 180.6 MB in the end (delta: -76.8 MB). Peak memory consumption was 22.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 42.41 ms. Allocated memory is still 203.9 MB. Free memory was 180.6 MB in the beginning and 177.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 557.52 ms. Allocated memory is still 203.9 MB. Free memory was 177.9 MB in the beginning and 147.2 MB in the end (delta: 30.7 MB). Peak memory consumption was 30.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 63482.22 ms. Allocated memory was 203.9 MB in the beginning and 853.0 MB in the end (delta: 649.1 MB). Free memory was 146.6 MB in the beginning and 671.9 MB in the end (delta: -525.3 MB). Peak memory consumption was 718.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 10]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 177]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 200]: Loop Invariant Derived loop invariant: (((((((((((((!(2 <= \old(E_M)) || !(2 <= \old(E_1))) || 0 == M_E) || 1 == \old(m_pc)) || !(2 <= T1_E)) || (((((2 <= E_1 && !(1 == m_pc)) && 2 <= T1_E) && !(0 == M_E)) && 2 <= E_M) && 2 <= m_st)) || !(2 <= \old(m_st))) && ((((((((!(2 <= \old(E_M)) || !(\old(t1_pc) <= 0)) || !(2 <= \old(t1_st))) || !(2 <= \old(E_1))) || 0 == M_E) || !(2 <= T1_E)) || (((((2 <= E_1 && !(1 == m_pc)) && 2 <= T1_E) && !(0 == M_E)) && 2 <= E_M) && 2 <= m_st)) || !(2 <= \old(m_st))) || t1_pc <= 0)) && ((((((((((((((!(2 <= \old(t1_st)) || !(\old(token) <= \old(local))) || !(\old(local) <= \old(token))) || !(2 <= T1_E)) || ((((((((0 == m_st && 2 <= E_1) && 2 <= T1_E) && token <= local + 1) && local + 1 <= token) && !(0 == M_E)) && 1 == t1_pc) && 2 <= E_M) && 2 <= t1_st)) || !(2 <= \old(E_M))) || (((((((2 <= E_1 && 2 <= T1_E) && token <= local) && !(0 == M_E)) && 1 == t1_pc) && 2 <= E_M) && local <= token) && 2 <= m_st)) || ((((((((m_st == \old(m_st) && \old(t1_st) == t1_st) && m_pc == \old(m_pc)) && E_1 == \old(E_1)) && token <= local) && 1 == t1_pc) && E_M == \old(E_M)) && local <= token) && \old(token) == token)) || !(0 == \old(m_st))) || 0 == M_E) || !(2 <= \old(E_1))) || 1 == \old(m_pc)) || (((((2 <= E_1 && !(1 == m_pc)) && 2 <= T1_E) && !(0 == M_E)) && 2 <= E_M) && 2 <= m_st)) || !(1 == \old(t1_pc))) || ((((((2 <= E_1 && 2 <= T1_E) && !(0 == M_E)) && 1 == t1_pc) && 2 <= E_M) && 2 <= t1_st) && 2 <= m_st))) && ((((((((((((!(2 <= \old(t1_st)) || !(2 <= T1_E)) || ((((((((0 == m_st && 2 <= E_1) && 2 <= T1_E) && token <= local + 1) && local + 1 <= token) && !(0 == M_E)) && 1 == t1_pc) && 2 <= E_M) && 2 <= t1_st)) || !(2 <= \old(E_M))) || (((((((2 <= E_1 && 2 <= T1_E) && token <= local) && !(0 == M_E)) && 1 == t1_pc) && 2 <= E_M) && local <= token) && 2 <= m_st)) || !(0 == \old(m_st))) || !(\old(token) <= \old(local) + 1)) || 0 == M_E) || !(2 <= \old(E_1))) || (((((2 <= E_1 && !(1 == m_pc)) && 2 <= T1_E) && !(0 == M_E)) && 2 <= E_M) && 2 <= m_st)) || !(\old(local) + 1 <= \old(token))) || !(1 == \old(t1_pc))) || ((((((2 <= E_1 && 2 <= T1_E) && !(0 == M_E)) && 1 == t1_pc) && 2 <= E_M) && 2 <= t1_st) && 2 <= m_st))) && (((((((((((((((((((0 == m_st && 2 <= E_1) && 2 <= T1_E) && token <= local + 1) && local + 1 <= token) && !(0 == M_E)) && 1 == t1_pc) && 2 <= E_M) && 2 <= t1_st) || !(2 <= \old(E_M))) || (((((((2 <= E_1 && 2 <= T1_E) && token <= local) && !(0 == M_E)) && 1 == t1_pc) && 2 <= E_M) && local <= token) && 2 <= m_st)) || !(\old(token) <= \old(local))) || 0 == M_E) || !(2 <= \old(E_1))) || !(\old(local) <= \old(token))) || !(2 <= T1_E)) || (((((2 <= E_1 && !(1 == m_pc)) && 2 <= T1_E) && !(0 == M_E)) && 2 <= E_M) && 2 <= m_st)) || !(2 <= \old(m_st))) || !(1 == \old(t1_pc))) || ((((((2 <= E_1 && 2 <= T1_E) && !(0 == M_E)) && 1 == t1_pc) && 2 <= E_M) && 2 <= t1_st) && 2 <= m_st))) && ((((((((!(2 <= \old(E_M)) || !(2 <= \old(t1_st))) || !(2 <= \old(E_1))) || 0 == M_E) || !(2 <= T1_E)) || (((((2 <= E_1 && !(1 == m_pc)) && 2 <= T1_E) && !(0 == M_E)) && 2 <= E_M) && 2 <= m_st)) || ((((((m_st == \old(m_st) && \old(t1_st) == t1_st) && E_1 == \old(E_1)) && local == \old(local)) && 1 == t1_pc) && E_M == \old(E_M)) && \old(token) == token)) || !(2 <= \old(m_st))) || !(1 == \old(t1_pc)))) && (((((((((((((((((((((((\old(t1_pc) == t1_pc && m_st == \old(m_st)) && \old(t1_st) == t1_st) && m_pc == \old(m_pc)) && E_1 == \old(E_1)) && token <= local) && E_M == \old(E_M)) && local <= token) && \old(token) == token) || !(\old(token) <= \old(local))) || !(\old(local) <= \old(token))) || !(2 <= T1_E)) || (((((2 <= E_1 && \old(t1_pc) == t1_pc) && 2 <= T1_E) && !(0 == M_E)) && 2 <= E_M) && 2 <= m_st)) || ((((((((0 == m_st && 2 <= E_1) && 2 <= T1_E) && token <= local + 1) && local + 1 <= token) && !(0 == M_E)) && 1 == t1_pc) && 2 <= E_M) && 2 <= t1_st)) || !(2 <= \old(E_M))) || (((((((2 <= E_1 && 2 <= T1_E) && token <= local) && !(0 == M_E)) && 1 == t1_pc) && 2 <= E_M) && local <= token) && 2 <= m_st)) || !(\old(t1_pc) <= 0)) || !(0 == \old(m_st))) || 0 == M_E) || !(2 <= \old(E_1))) || 1 == \old(m_pc)) || (((((2 <= E_1 && !(1 == m_pc)) && 2 <= T1_E) && !(0 == M_E)) && 2 <= E_M) && 2 <= m_st)) || ((((((((((((0 == m_st && 2 <= E_1) && 2 <= T1_E) && 2 <= E_M) && 2 <= t1_st) && \old(token) == token) && !(1 == m_pc)) && E_1 == \old(E_1)) && token <= local) && !(0 == M_E)) && 1 == t1_pc) && E_M == \old(E_M)) && local <= token)) || ((((((2 <= E_1 && 2 <= T1_E) && !(0 == M_E)) && 1 == t1_pc) && 2 <= E_M) && 2 <= t1_st) && 2 <= m_st))) && ((((((((((!(2 <= \old(E_M)) || !(\old(t1_pc) <= 0)) || !(0 == \old(m_st))) || !(2 <= \old(t1_st))) || !(2 <= \old(E_1))) || 0 == M_E) || 1 == \old(m_pc)) || ((((((2 <= E_1 && \old(t1_pc) == t1_pc) && 2 <= T1_E) && !(0 == M_E)) && 2 <= E_M) && 2 <= t1_st) && 2 <= m_st)) || !(2 <= T1_E)) || (((((((\old(t1_pc) == t1_pc && m_st == \old(m_st)) && \old(t1_st) == t1_st) && m_pc == \old(m_pc)) && E_1 == \old(E_1)) && local == \old(local)) && E_M == \old(E_M)) && \old(token) == token)) || (((((2 <= E_1 && !(1 == m_pc)) && 2 <= T1_E) && !(0 == M_E)) && 2 <= E_M) && 2 <= m_st))) && ((((((((!(2 <= \old(E_M)) || ((((E_1 == \old(E_1) && 1 == t1_pc) && 2 <= t1_st) && E_M == \old(E_M)) && 2 <= m_st)) || !(\old(t1_pc) <= 0)) || !(2 <= \old(E_1))) || 0 == M_E) || !(2 <= T1_E)) || (((((2 <= E_1 && !(1 == m_pc)) && 2 <= T1_E) && !(0 == M_E)) && 2 <= E_M) && 2 <= m_st)) || !(2 <= \old(m_st))) || ((((((\old(t1_pc) == t1_pc && m_st == \old(m_st)) && \old(t1_st) == t1_st) && E_1 == \old(E_1)) && local == \old(local)) && E_M == \old(E_M)) && \old(token) == token)) - InvariantResult [Line: 113]: Loop Invariant Derived loop invariant: (((((((((((((((!(2 <= E_1) || !(1 == t1_pc)) || !(0 == m_st)) || !(2 <= E_M)) || !(2 <= t1_st)) || 0 == M_E) || !(2 <= T1_E)) || !(local + 1 <= token)) || (0 <= __retres1 && __retres1 <= 0)) || !(token <= local + 1)) && ((((((!(2 <= E_1) || !(2 <= E_M)) || !(2 <= m_st)) || 0 == M_E) || !(2 <= T1_E)) || !(t1_pc <= 0)) || (0 <= __retres1 && __retres1 <= 0))) && (((((((!(2 <= E_1) || !(1 == t1_pc)) || !(2 <= E_M)) || !(2 <= t1_st)) || !(2 <= m_st)) || 0 == M_E) || !(2 <= T1_E)) || (0 <= __retres1 && __retres1 <= 0))) && ((((((!(2 <= E_M) || 0 == M_E) || !(2 <= T1_E)) || !(t1_pc <= 0)) || 1 == m_pc) || 0 == E_1) || (0 <= __retres1 && __retres1 <= 0))) && ((((((((!(2 <= E_1) || !(1 == t1_pc)) || 1 == E_M) || !(2 <= m_st)) || 0 == M_E) || !(2 <= T1_E)) || !(local + 1 <= token)) || (0 <= __retres1 && __retres1 <= 0)) || !(token <= local + 1))) && ((((((((!(2 <= E_1) || !(1 == t1_pc)) || !(token <= local)) || !(2 <= E_M)) || !(2 <= m_st)) || 0 == M_E) || !(2 <= T1_E)) || !(local <= token)) || (0 <= __retres1 && __retres1 <= 0))) && ((((((((!(1 == t1_pc) || !(token <= local)) || !(2 <= E_M)) || !(2 <= t1_st)) || 0 == M_E) || !(2 <= T1_E)) || 0 == E_1) || (0 <= __retres1 && __retres1 <= 0)) || !(local <= token))) && (((((!(2 <= E_1) || !(2 <= m_st)) || 0 == M_E) || !(2 <= T1_E)) || 1 == m_pc) || (0 <= __retres1 && __retres1 <= 0)) - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: (((((((((!(2 <= E_M) || !(2 <= \old(t1_st))) || !(2 <= \old(E_1))) || 0 == M_E) || 1 == \old(m_pc)) || !(2 <= T1_E)) || 2 <= t1_st) || !(t1_pc <= 0)) && ((((((((((!(1 == t1_pc) || !(2 <= E_M)) || !(2 <= \old(t1_st))) || !(2 <= \old(E_1))) || !(\old(token) <= \old(local))) || 0 == M_E) || 1 == \old(m_pc)) || !(\old(local) <= \old(token))) || !(2 <= T1_E)) || ((((2 <= E_1 && 2 <= T1_E) && 2 <= t1_st) && 2 <= E_M) && 2 <= m_st)) || ((((2 <= E_1 && token <= local) && 2 <= E_M) && local <= token) && 2 <= m_st))) && (((((((((!(1 == t1_pc) || !(2 <= E_M)) || !(\old(token) <= \old(local) + 1)) || !(2 <= \old(t1_st))) || !(2 <= \old(E_1))) || 0 == M_E) || !(2 <= T1_E)) || !(\old(local) + 1 <= \old(token))) || ((((2 <= E_1 && 2 <= T1_E) && 2 <= t1_st) && 2 <= E_M) && 2 <= m_st)) || ((((2 <= E_1 && token <= local) && 2 <= E_M) && local <= token) && 2 <= m_st))) && (((((((2 <= E_1 && 2 <= m_st) || !(2 <= E_M)) || !(2 <= \old(E_1))) || 0 == M_E) || 1 == \old(m_pc)) || !(2 <= T1_E)) || !(t1_pc <= 0)) - InvariantResult [Line: 77]: Loop Invariant Derived loop invariant: ((((((((((((!(2 <= E_1) || !(2 <= \old(E_M))) || !(1 == m_pc)) || ((((0 == m_st && token <= local + 1) && local + 1 <= token) && 1 == t1_pc) && 2 <= E_M)) || !(local <= \old(token))) || 0 == M_E) || !(2 <= T1_E)) || (((m_st == \old(m_st) && \old(t1_st) == t1_st) && 1 == t1_pc) && 2 <= E_M)) || !(2 <= \old(m_st))) || !(1 == \old(t1_pc))) || !(\old(token) <= local)) && (((((((!(2 <= E_1) || !(2 <= \old(E_M))) || !(\old(t1_pc) <= 0)) || ((((\old(t1_pc) == t1_pc && m_st == \old(m_st)) && \old(t1_st) == t1_st) && E_M == \old(E_M)) && \old(token) == token)) || (((!(1 == m_pc) && m_st == \old(m_st)) && \old(t1_st) == t1_st) && 2 <= E_M)) || 0 == M_E) || !(2 <= T1_E)) || !(2 <= \old(m_st)))) && ((((((!(2 <= E_1) || !(2 <= \old(E_M))) || (((!(1 == m_pc) && m_st == \old(m_st)) && \old(t1_st) == t1_st) && 2 <= E_M)) || 0 == M_E) || !(2 <= T1_E)) || 1 == m_pc) || !(2 <= \old(m_st)))) && (((((((((!(2 <= E_1) || !(2 <= \old(E_M))) || !(\old(t1_pc) <= 0)) || !(0 == \old(m_st))) || (((((\old(t1_pc) == t1_pc && m_st == \old(m_st)) && \old(t1_st) == t1_st) && token <= local) && E_M == \old(E_M)) && local <= token)) || !(local <= \old(token))) || 0 == M_E) || !(2 <= T1_E)) || 1 == m_pc) || !(\old(token) <= local)) - InvariantResult [Line: 194]: Loop Invariant Derived loop invariant: (((((((((((((!(2 <= \old(E_M)) || !(2 <= \old(E_1))) || 0 == M_E) || 1 == \old(m_pc)) || !(2 <= T1_E)) || (((((2 <= E_1 && !(1 == m_pc)) && 2 <= T1_E) && !(0 == M_E)) && 2 <= E_M) && 2 <= m_st)) || !(2 <= \old(m_st))) && ((((((((!(2 <= \old(E_M)) || !(\old(t1_pc) <= 0)) || !(2 <= \old(t1_st))) || !(2 <= \old(E_1))) || 0 == M_E) || !(2 <= T1_E)) || (((((2 <= E_1 && !(1 == m_pc)) && 2 <= T1_E) && !(0 == M_E)) && 2 <= E_M) && 2 <= m_st)) || !(2 <= \old(m_st))) || t1_pc <= 0)) && ((((((((((((((!(2 <= \old(t1_st)) || !(\old(token) <= \old(local))) || !(\old(local) <= \old(token))) || !(2 <= T1_E)) || ((((((((0 == m_st && 2 <= E_1) && 2 <= T1_E) && token <= local + 1) && local + 1 <= token) && !(0 == M_E)) && 1 == t1_pc) && 2 <= E_M) && 2 <= t1_st)) || !(2 <= \old(E_M))) || (((((((2 <= E_1 && 2 <= T1_E) && token <= local) && !(0 == M_E)) && 1 == t1_pc) && 2 <= E_M) && local <= token) && 2 <= m_st)) || ((((((((m_st == \old(m_st) && \old(t1_st) == t1_st) && m_pc == \old(m_pc)) && E_1 == \old(E_1)) && token <= local) && 1 == t1_pc) && E_M == \old(E_M)) && local <= token) && \old(token) == token)) || !(0 == \old(m_st))) || 0 == M_E) || !(2 <= \old(E_1))) || 1 == \old(m_pc)) || (((((2 <= E_1 && !(1 == m_pc)) && 2 <= T1_E) && !(0 == M_E)) && 2 <= E_M) && 2 <= m_st)) || !(1 == \old(t1_pc))) || ((((((2 <= E_1 && 2 <= T1_E) && !(0 == M_E)) && 1 == t1_pc) && 2 <= E_M) && 2 <= t1_st) && 2 <= m_st))) && ((((((((((((!(2 <= \old(t1_st)) || !(2 <= T1_E)) || ((((((((0 == m_st && 2 <= E_1) && 2 <= T1_E) && token <= local + 1) && local + 1 <= token) && !(0 == M_E)) && 1 == t1_pc) && 2 <= E_M) && 2 <= t1_st)) || !(2 <= \old(E_M))) || (((((((2 <= E_1 && 2 <= T1_E) && token <= local) && !(0 == M_E)) && 1 == t1_pc) && 2 <= E_M) && local <= token) && 2 <= m_st)) || !(0 == \old(m_st))) || !(\old(token) <= \old(local) + 1)) || 0 == M_E) || !(2 <= \old(E_1))) || (((((2 <= E_1 && !(1 == m_pc)) && 2 <= T1_E) && !(0 == M_E)) && 2 <= E_M) && 2 <= m_st)) || !(\old(local) + 1 <= \old(token))) || !(1 == \old(t1_pc))) || ((((((2 <= E_1 && 2 <= T1_E) && !(0 == M_E)) && 1 == t1_pc) && 2 <= E_M) && 2 <= t1_st) && 2 <= m_st))) && (((((((((((((((((((0 == m_st && 2 <= E_1) && 2 <= T1_E) && token <= local + 1) && local + 1 <= token) && !(0 == M_E)) && 1 == t1_pc) && 2 <= E_M) && 2 <= t1_st) || !(2 <= \old(E_M))) || (((((((2 <= E_1 && 2 <= T1_E) && token <= local) && !(0 == M_E)) && 1 == t1_pc) && 2 <= E_M) && local <= token) && 2 <= m_st)) || !(\old(token) <= \old(local))) || 0 == M_E) || !(2 <= \old(E_1))) || !(\old(local) <= \old(token))) || !(2 <= T1_E)) || (((((2 <= E_1 && !(1 == m_pc)) && 2 <= T1_E) && !(0 == M_E)) && 2 <= E_M) && 2 <= m_st)) || !(2 <= \old(m_st))) || !(1 == \old(t1_pc))) || ((((((2 <= E_1 && 2 <= T1_E) && !(0 == M_E)) && 1 == t1_pc) && 2 <= E_M) && 2 <= t1_st) && 2 <= m_st))) && ((((((((!(2 <= \old(E_M)) || !(2 <= \old(t1_st))) || !(2 <= \old(E_1))) || 0 == M_E) || !(2 <= T1_E)) || (((((2 <= E_1 && !(1 == m_pc)) && 2 <= T1_E) && !(0 == M_E)) && 2 <= E_M) && 2 <= m_st)) || ((((((m_st == \old(m_st) && \old(t1_st) == t1_st) && E_1 == \old(E_1)) && local == \old(local)) && 1 == t1_pc) && E_M == \old(E_M)) && \old(token) == token)) || !(2 <= \old(m_st))) || !(1 == \old(t1_pc)))) && (((((((((((((((((((((((\old(t1_pc) == t1_pc && m_st == \old(m_st)) && \old(t1_st) == t1_st) && m_pc == \old(m_pc)) && E_1 == \old(E_1)) && token <= local) && E_M == \old(E_M)) && local <= token) && \old(token) == token) || !(\old(token) <= \old(local))) || !(\old(local) <= \old(token))) || !(2 <= T1_E)) || (((((2 <= E_1 && \old(t1_pc) == t1_pc) && 2 <= T1_E) && !(0 == M_E)) && 2 <= E_M) && 2 <= m_st)) || ((((((((0 == m_st && 2 <= E_1) && 2 <= T1_E) && token <= local + 1) && local + 1 <= token) && !(0 == M_E)) && 1 == t1_pc) && 2 <= E_M) && 2 <= t1_st)) || !(2 <= \old(E_M))) || (((((((2 <= E_1 && 2 <= T1_E) && token <= local) && !(0 == M_E)) && 1 == t1_pc) && 2 <= E_M) && local <= token) && 2 <= m_st)) || !(\old(t1_pc) <= 0)) || !(0 == \old(m_st))) || 0 == M_E) || !(2 <= \old(E_1))) || 1 == \old(m_pc)) || (((((2 <= E_1 && !(1 == m_pc)) && 2 <= T1_E) && !(0 == M_E)) && 2 <= E_M) && 2 <= m_st)) || ((((((((((((0 == m_st && 2 <= E_1) && 2 <= T1_E) && 2 <= E_M) && 2 <= t1_st) && \old(token) == token) && !(1 == m_pc)) && E_1 == \old(E_1)) && token <= local) && !(0 == M_E)) && 1 == t1_pc) && E_M == \old(E_M)) && local <= token)) || ((((((2 <= E_1 && 2 <= T1_E) && !(0 == M_E)) && 1 == t1_pc) && 2 <= E_M) && 2 <= t1_st) && 2 <= m_st))) && ((((((((((!(2 <= \old(E_M)) || !(\old(t1_pc) <= 0)) || !(0 == \old(m_st))) || !(2 <= \old(t1_st))) || !(2 <= \old(E_1))) || 0 == M_E) || 1 == \old(m_pc)) || ((((((2 <= E_1 && \old(t1_pc) == t1_pc) && 2 <= T1_E) && !(0 == M_E)) && 2 <= E_M) && 2 <= t1_st) && 2 <= m_st)) || !(2 <= T1_E)) || (((((((\old(t1_pc) == t1_pc && m_st == \old(m_st)) && \old(t1_st) == t1_st) && m_pc == \old(m_pc)) && E_1 == \old(E_1)) && local == \old(local)) && E_M == \old(E_M)) && \old(token) == token)) || (((((2 <= E_1 && !(1 == m_pc)) && 2 <= T1_E) && !(0 == M_E)) && 2 <= E_M) && 2 <= m_st))) && ((((((((!(2 <= \old(E_M)) || ((((E_1 == \old(E_1) && 1 == t1_pc) && 2 <= t1_st) && E_M == \old(E_M)) && 2 <= m_st)) || !(\old(t1_pc) <= 0)) || !(2 <= \old(E_1))) || 0 == M_E) || !(2 <= T1_E)) || (((((2 <= E_1 && !(1 == m_pc)) && 2 <= T1_E) && !(0 == M_E)) && 2 <= E_M) && 2 <= m_st)) || !(2 <= \old(m_st))) || ((((((\old(t1_pc) == t1_pc && m_st == \old(m_st)) && \old(t1_st) == t1_st) && E_1 == \old(E_1)) && local == \old(local)) && E_M == \old(E_M)) && \old(token) == token)) - InvariantResult [Line: 74]: Loop Invariant Derived loop invariant: ((((((((!(2 <= E_1) || !(2 <= \old(E_M))) || 0 == M_E) || !(2 <= T1_E)) || 1 == m_pc) || !(2 <= \old(m_st))) || (((2 <= E_1 && !(1 == m_pc)) && 2 <= E_M) && 2 <= m_st)) && ((((((((((!(2 <= E_1) || !(2 <= \old(E_M))) || (((1 == t1_pc && 2 <= E_M) && 2 <= t1_st) && 2 <= m_st)) || !(local <= \old(token))) || 0 == M_E) || !(2 <= T1_E)) || (((((0 == m_st && token <= local + 1) && local + 1 <= token) && 1 == t1_pc) && 2 <= E_M) && 2 <= t1_st)) || !(2 <= \old(m_st))) || (((2 <= E_1 && !(1 == m_pc)) && 2 <= E_M) && 2 <= m_st)) || !(1 == \old(t1_pc))) || !(\old(token) <= local))) && (((((((((!(2 <= E_1) || !(2 <= \old(E_M))) || !(\old(t1_pc) <= 0)) || !(0 == \old(m_st))) || !(local <= \old(token))) || 0 == M_E) || !(2 <= T1_E)) || (((((0 == m_st && token <= local) && 1 == t1_pc) && 2 <= t1_st) && E_M == \old(E_M)) && local <= token)) || 1 == m_pc) || !(\old(token) <= local))) && (((((((!(2 <= E_1) || !(2 <= \old(E_M))) || !(\old(t1_pc) <= 0)) || 0 == M_E) || !(2 <= T1_E)) || (((1 == t1_pc && 2 <= t1_st) && E_M == \old(E_M)) && 2 <= m_st)) || !(2 <= \old(m_st))) || (((2 <= E_1 && !(1 == m_pc)) && 2 <= E_M) && 2 <= m_st)) - InvariantResult [Line: 77]: Loop Invariant Derived loop invariant: ((((((((!(2 <= E_1) || !(2 <= \old(E_M))) || ((((\old(t1_pc) == t1_pc && m_st == \old(m_st)) && \old(t1_st) == t1_st) && E_M == \old(E_M)) && \old(token) == token)) || 0 == M_E) || !(2 <= T1_E)) || 1 == m_pc) || !(2 <= \old(m_st))) && ((((((((!(2 <= E_1) || !(2 <= \old(E_M))) || !(\old(t1_pc) <= 0)) || !(0 == \old(m_st))) || !(local <= \old(token))) || 0 == M_E) || !(2 <= T1_E)) || 1 == m_pc) || !(\old(token) <= local))) && (((((!(2 <= E_1) || !(2 <= \old(E_M))) || !(\old(t1_pc) <= 0)) || 0 == M_E) || !(2 <= T1_E)) || !(2 <= \old(m_st)))) && ((((((((!(2 <= E_1) || !(2 <= \old(E_M))) || !(local <= \old(token))) || 0 == M_E) || !(2 <= T1_E)) || (((((m_st == \old(m_st) && \old(t1_st) == t1_st) && token <= local) && 1 == t1_pc) && E_M == \old(E_M)) && local <= token)) || !(2 <= \old(m_st))) || !(1 == \old(t1_pc))) || !(\old(token) <= local)) - InvariantResult [Line: 415]: Loop Invariant Derived loop invariant: ((((((((((((((((((((2 <= E_1 && \old(t1_pc) == t1_pc) && \old(T1_E) == T1_E) && !(0 == M_E)) && 2 <= E_M) && 2 <= m_st) || ((((((((0 == m_st && 2 <= E_1) && \old(T1_E) == T1_E) && token <= local + 1) && local + 1 <= token) && !(0 == M_E)) && 1 == t1_pc) && 2 <= E_M) && 2 <= t1_st)) || !(\old(token) <= \old(local))) || (((((2 <= E_1 && !(1 == m_pc)) && \old(T1_E) == T1_E) && !(0 == M_E)) && 2 <= E_M) && 2 <= m_st)) || !(\old(local) <= \old(token))) || ((((((2 <= E_1 && \old(T1_E) == T1_E) && !(0 == M_E)) && 1 == t1_pc) && 2 <= E_M) && 2 <= t1_st) && 2 <= m_st)) || ((((((((((0 == m_st && 2 <= E_1) && !(1 == m_pc)) && \old(T1_E) == T1_E) && token <= local) && !(0 == M_E)) && 1 == t1_pc) && 2 <= E_M) && 2 <= t1_st) && local <= token) && \old(token) == token)) || !(2 <= \old(E_M))) || (((((((0 == m_st && 2 <= E_1) && \old(t1_pc) == t1_pc) && !(1 == m_pc)) && \old(T1_E) == T1_E) && !(0 == M_E)) && 2 <= E_M) && 2 <= t1_st)) || (((((((2 <= E_1 && \old(T1_E) == T1_E) && token <= local) && !(0 == M_E)) && 1 == t1_pc) && 2 <= E_M) && local <= token) && 2 <= m_st)) || !(\old(t1_pc) <= 0)) || !(0 == \old(m_st))) || !(2 <= \old(E_1))) || 1 == \old(m_pc)) || (((((((((0 == m_st && 2 <= E_1) && \old(t1_pc) == t1_pc) && !(1 == m_pc)) && \old(T1_E) == T1_E) && token <= local) && !(0 == M_E)) && 2 <= E_M) && local <= token) && \old(token) == token)) || !(2 <= \old(M_E))) || !(2 <= \old(T1_E)) - InvariantResult [Line: 33]: Loop Invariant Derived loop invariant: ((((((((((!(1 == t1_pc) || !(2 <= E_M)) || !(\old(token) <= \old(local) + 1)) || !(2 <= \old(t1_st))) || !(2 <= \old(E_1))) || (((((m_st == \old(m_st) && \old(t1_st) == t1_st) && m_pc == \old(m_pc)) && E_1 == \old(E_1)) && local == \old(local)) && \old(token) == token)) || 0 == M_E) || !(2 <= T1_E)) || !(\old(local) + 1 <= \old(token))) && ((((((((!(1 == t1_pc) || !(2 <= E_M)) || !(2 <= \old(t1_st))) || !(2 <= \old(E_1))) || !(\old(token) <= \old(local))) || 0 == M_E) || 1 == \old(m_pc)) || !(\old(local) <= \old(token))) || !(2 <= T1_E))) && (((((!(2 <= E_M) || !(2 <= \old(E_1))) || 0 == M_E) || 1 == \old(m_pc)) || !(2 <= T1_E)) || !(t1_pc <= 0))) && ((((((((!(1 == t1_pc) || !(2 <= E_M)) || !(\old(token) <= \old(local) + 1)) || !(2 <= \old(t1_st))) || !(2 <= \old(E_1))) || 0 == M_E) || 1 == \old(m_pc)) || !(2 <= T1_E)) || !(\old(local) + 1 <= \old(token))) - InvariantResult [Line: 132]: Loop Invariant Derived loop invariant: (((((((((!(2 <= E_1) || !(1 == t1_pc)) || (0 <= __retres1 && __retres1 <= 0)) || !(2 <= m_st)) || 0 == M_E) || !(2 <= T1_E)) && (((((!(2 <= E_1) || !(2 <= m_st)) || 0 == M_E) || (0 <= __retres1 && __retres1 <= 0)) || !(2 <= T1_E)) || 1 == m_pc)) && ((((((!(2 <= E_M) || (0 <= __retres1 && __retres1 <= 0)) || 0 == M_E) || !(2 <= T1_E)) || !(t1_pc <= 0)) || 1 == m_pc) || 0 == E_1)) && ((((((((((!(2 <= E_1) || !(1 == t1_pc)) || !(0 == m_st)) || !(token <= local)) || !(2 <= E_M)) || !(2 <= t1_st)) || (0 <= __retres1 && __retres1 <= 0)) || 0 == M_E) || !(2 <= T1_E)) || 1 == m_pc) || !(local <= token))) && ((((((!(2 <= E_1) || !(2 <= E_M)) || (0 <= __retres1 && __retres1 <= 0)) || !(2 <= m_st)) || 0 == M_E) || !(2 <= T1_E)) || !(t1_pc <= 0))) && (((((((!(2 <= E_1) || !(1 == t1_pc)) || !(0 == m_st)) || (0 <= __retres1 && __retres1 <= 0)) || 0 == M_E) || !(2 <= T1_E)) || !(local + 1 <= token)) || !(token <= local + 1)) - InvariantResult [Line: 403]: Loop Invariant Derived loop invariant: ((((((((!(2 <= \old(E_M)) || !(\old(t1_pc) <= 0)) || !(0 == \old(m_st))) || !(2 <= \old(E_1))) || !(\old(token) <= \old(local))) || 1 == \old(m_pc)) || !(\old(local) <= \old(token))) || !(0 == M_E)) || !(2 <= \old(M_E))) || !(2 <= \old(T1_E)) - InvariantResult [Line: 388]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 33]: Loop Invariant Derived loop invariant: (((((((!(2 <= E_M) || !(2 <= \old(E_1))) || 0 == M_E) || (((((m_st == \old(m_st) && \old(t1_st) == t1_st) && m_pc == \old(m_pc)) && E_1 == \old(E_1)) && local == \old(local)) && \old(token) == token)) || 1 == \old(m_pc)) || !(2 <= T1_E)) || !(t1_pc <= 0)) && (((((((((!(1 == t1_pc) || !(2 <= E_M)) || ((((((m_st == \old(m_st) && \old(t1_st) == t1_st) && m_pc == \old(m_pc)) && E_1 == \old(E_1)) && token <= local) && local <= token) && \old(token) == token)) || !(2 <= \old(t1_st))) || !(2 <= \old(E_1))) || !(\old(token) <= \old(local))) || 0 == M_E) || 1 == \old(m_pc)) || !(\old(local) <= \old(token))) || !(2 <= T1_E))) && ((((((((!(1 == t1_pc) || !(2 <= E_M)) || !(\old(token) <= \old(local) + 1)) || !(2 <= \old(t1_st))) || !(2 <= \old(E_1))) || (((((m_st == \old(m_st) && \old(t1_st) == t1_st) && m_pc == \old(m_pc)) && E_1 == \old(E_1)) && local == \old(local)) && \old(token) == token)) || 0 == M_E) || !(2 <= T1_E)) || !(\old(local) + 1 <= \old(token))) - StatisticsResult: Ultimate Automizer benchmark data CFG has 21 procedures, 144 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 23.5s, OverallIterations: 13, TraceHistogramMax: 3, AutomataDifference: 16.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 39.8s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2269 SDtfs, 5496 SDslu, 1065 SDs, 0 SdLazy, 8899 SolverSat, 2969 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1570 GetRequests, 1372 SyntacticMatches, 5 SemanticMatches, 193 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 548 ImplicationChecksByTransitivity, 3.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1598occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 1144 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 62 LocationsWithAnnotation, 3649 PreInvPairs, 4853 NumberOfFragments, 13170 HoareAnnotationTreeSize, 3649 FomulaSimplifications, 25623323 FormulaSimplificationTreeSizeReduction, 11.6s HoareSimplificationTime, 62 FomulaSimplificationsInter, 497283 FormulaSimplificationTreeSizeReductionInter, 27.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 2461 NumberOfCodeBlocks, 2461 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 2442 ConstructedInterpolants, 0 QuantifiedInterpolants, 747441 SizeOfPredicates, 8 NumberOfNonLiveVariables, 3947 ConjunctsInSsa, 37 ConjunctsInUnsatCore, 19 InterpolantComputations, 11 PerfectInterpolantSequences, 873/1000 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...