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 -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/systemc/token_ring.02.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 16:19:33,768 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 16:19:33,770 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 16:19:33,791 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 16:19:33,792 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 16:19:33,793 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 16:19:33,795 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 16:19:33,801 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 16:19:33,802 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 16:19:33,803 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 16:19:33,808 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 16:19:33,810 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 16:19:33,810 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 16:19:33,811 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 16:19:33,814 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 16:19:33,815 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 16:19:33,816 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 16:19:33,819 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 16:19:33,823 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 16:19:33,825 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 16:19:33,829 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 16:19:33,830 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 16:19:33,831 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 16:19:33,833 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 16:19:33,837 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 16:19:33,837 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 16:19:33,837 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 16:19:33,838 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 16:19:33,840 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 16:19:33,842 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 16:19:33,842 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 16:19:33,843 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 16:19:33,844 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 16:19:33,845 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 16:19:33,847 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 16:19:33,847 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 16:19:33,847 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 16:19:33,848 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 16:19:33,848 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 16:19:33,850 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 16:19:33,852 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 16:19:33,854 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 [2019-10-02 16:19:33,870 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 16:19:33,870 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 16:19:33,871 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 16:19:33,872 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 16:19:33,872 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 16:19:33,872 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 16:19:33,872 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 16:19:33,873 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 16:19:33,873 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 16:19:33,873 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 16:19:33,873 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 16:19:33,873 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 16:19:33,874 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 16:19:33,874 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 16:19:33,874 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 16:19:33,874 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 16:19:33,875 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 16:19:33,875 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 16:19:33,875 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 16:19:33,875 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 16:19:33,875 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 16:19:33,876 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 16:19:33,876 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 16:19:33,876 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 16:19:33,876 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 16:19:33,877 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 16:19:33,877 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 16:19:33,877 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 16:19:33,877 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 16:19:33,913 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 16:19:33,933 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 16:19:33,936 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 16:19:33,938 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 16:19:33,938 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 16:19:33,939 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/token_ring.02.cil-1.c [2019-10-02 16:19:34,011 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45a366005/ea97dd45f129457494b3b2516a4e5873/FLAGd68fcbf81 [2019-10-02 16:19:34,480 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 16:19:34,480 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/token_ring.02.cil-1.c [2019-10-02 16:19:34,495 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45a366005/ea97dd45f129457494b3b2516a4e5873/FLAGd68fcbf81 [2019-10-02 16:19:34,802 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45a366005/ea97dd45f129457494b3b2516a4e5873 [2019-10-02 16:19:34,811 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 16:19:34,813 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 16:19:34,814 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 16:19:34,815 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 16:19:34,820 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 16:19:34,821 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 04:19:34" (1/1) ... [2019-10-02 16:19:34,826 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31140a5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 04:19:34, skipping insertion in model container [2019-10-02 16:19:34,826 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 04:19:34" (1/1) ... [2019-10-02 16:19:34,834 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 16:19:34,882 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 16:19:35,114 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 16:19:35,125 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 16:19:35,257 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 16:19:35,281 INFO L192 MainTranslator]: Completed translation [2019-10-02 16:19:35,282 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 04:19:35 WrapperNode [2019-10-02 16:19:35,282 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 16:19:35,283 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 16:19:35,283 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 16:19:35,283 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 16:19:35,298 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 04:19:35" (1/1) ... [2019-10-02 16:19:35,298 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 04:19:35" (1/1) ... [2019-10-02 16:19:35,305 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 04:19:35" (1/1) ... [2019-10-02 16:19:35,306 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 04:19:35" (1/1) ... [2019-10-02 16:19:35,316 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 04:19:35" (1/1) ... [2019-10-02 16:19:35,327 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 04:19:35" (1/1) ... [2019-10-02 16:19:35,330 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 04:19:35" (1/1) ... [2019-10-02 16:19:35,334 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 16:19:35,335 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 16:19:35,335 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 16:19:35,335 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 16:19:35,336 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 04:19:35" (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 [2019-10-02 16:19:35,399 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 16:19:35,399 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 16:19:35,399 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2019-10-02 16:19:35,399 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2019-10-02 16:19:35,400 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2019-10-02 16:19:35,400 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit2 [2019-10-02 16:19:35,400 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2019-10-02 16:19:35,401 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2019-10-02 16:19:35,401 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit2_triggered [2019-10-02 16:19:35,401 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2019-10-02 16:19:35,401 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2019-10-02 16:19:35,401 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2019-10-02 16:19:35,402 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2019-10-02 16:19:35,402 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2019-10-02 16:19:35,403 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2019-10-02 16:19:35,403 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2019-10-02 16:19:35,404 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2019-10-02 16:19:35,404 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2019-10-02 16:19:35,404 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2019-10-02 16:19:35,404 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2019-10-02 16:19:35,404 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2019-10-02 16:19:35,404 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2019-10-02 16:19:35,404 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 16:19:35,405 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 16:19:35,405 INFO L130 BoogieDeclarations]: Found specification of procedure error [2019-10-02 16:19:35,405 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2019-10-02 16:19:35,405 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2019-10-02 16:19:35,405 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit2_triggered [2019-10-02 16:19:35,405 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2019-10-02 16:19:35,406 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 16:19:35,406 INFO L130 BoogieDeclarations]: Found specification of procedure master [2019-10-02 16:19:35,406 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2019-10-02 16:19:35,406 INFO L130 BoogieDeclarations]: Found specification of procedure transmit2 [2019-10-02 16:19:35,406 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2019-10-02 16:19:35,406 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2019-10-02 16:19:35,407 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2019-10-02 16:19:35,407 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2019-10-02 16:19:35,407 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2019-10-02 16:19:35,407 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2019-10-02 16:19:35,407 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2019-10-02 16:19:35,407 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2019-10-02 16:19:35,408 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2019-10-02 16:19:35,408 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2019-10-02 16:19:35,408 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2019-10-02 16:19:35,408 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2019-10-02 16:19:35,408 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 16:19:35,408 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 16:19:35,409 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 16:19:36,049 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 16:19:36,049 INFO L283 CfgBuilder]: Removed 5 assume(true) statements. [2019-10-02 16:19:36,051 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 04:19:36 BoogieIcfgContainer [2019-10-02 16:19:36,051 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 16:19:36,055 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 16:19:36,055 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 16:19:36,060 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 16:19:36,061 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 04:19:34" (1/3) ... [2019-10-02 16:19:36,062 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b1a01d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 04:19:36, skipping insertion in model container [2019-10-02 16:19:36,062 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 04:19:35" (2/3) ... [2019-10-02 16:19:36,063 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b1a01d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 04:19:36, skipping insertion in model container [2019-10-02 16:19:36,063 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 04:19:36" (3/3) ... [2019-10-02 16:19:36,065 INFO L109 eAbstractionObserver]: Analyzing ICFG token_ring.02.cil-1.c [2019-10-02 16:19:36,078 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 16:19:36,089 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 16:19:36,107 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 16:19:36,150 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 16:19:36,151 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 16:19:36,151 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 16:19:36,151 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 16:19:36,151 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 16:19:36,152 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 16:19:36,152 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 16:19:36,152 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 16:19:36,152 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 16:19:36,177 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states. [2019-10-02 16:19:36,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-10-02 16:19:36,189 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:19:36,190 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 16:19:36,193 INFO L418 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:19:36,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:19:36,199 INFO L82 PathProgramCache]: Analyzing trace with hash 1715943758, now seen corresponding path program 1 times [2019-10-02 16:19:36,201 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:19:36,202 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:19:36,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:19:36,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:19:36,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:19:36,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:19:36,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 16:19:36,568 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:19:36,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 16:19:36,576 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 16:19:36,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 16:19:36,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 16:19:36,596 INFO L87 Difference]: Start difference. First operand 174 states. Second operand 5 states. [2019-10-02 16:19:37,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:19:37,281 INFO L93 Difference]: Finished difference Result 361 states and 528 transitions. [2019-10-02 16:19:37,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 16:19:37,283 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2019-10-02 16:19:37,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:19:37,308 INFO L225 Difference]: With dead ends: 361 [2019-10-02 16:19:37,308 INFO L226 Difference]: Without dead ends: 195 [2019-10-02 16:19:37,321 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 16:19:37,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-10-02 16:19:37,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 165. [2019-10-02 16:19:37,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-10-02 16:19:37,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 222 transitions. [2019-10-02 16:19:37,448 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 222 transitions. Word has length 91 [2019-10-02 16:19:37,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:19:37,450 INFO L475 AbstractCegarLoop]: Abstraction has 165 states and 222 transitions. [2019-10-02 16:19:37,450 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 16:19:37,450 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 222 transitions. [2019-10-02 16:19:37,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-10-02 16:19:37,459 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:19:37,460 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 16:19:37,460 INFO L418 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:19:37,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:19:37,462 INFO L82 PathProgramCache]: Analyzing trace with hash -1625083380, now seen corresponding path program 1 times [2019-10-02 16:19:37,462 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:19:37,463 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:19:37,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:19:37,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:19:37,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:19:37,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:19:37,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 16:19:37,676 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:19:37,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 16:19:37,682 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 16:19:37,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 16:19:37,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 16:19:37,683 INFO L87 Difference]: Start difference. First operand 165 states and 222 transitions. Second operand 5 states. [2019-10-02 16:19:38,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:19:38,155 INFO L93 Difference]: Finished difference Result 338 states and 470 transitions. [2019-10-02 16:19:38,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 16:19:38,156 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2019-10-02 16:19:38,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:19:38,159 INFO L225 Difference]: With dead ends: 338 [2019-10-02 16:19:38,160 INFO L226 Difference]: Without dead ends: 193 [2019-10-02 16:19:38,161 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 16:19:38,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2019-10-02 16:19:38,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 165. [2019-10-02 16:19:38,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-10-02 16:19:38,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 221 transitions. [2019-10-02 16:19:38,184 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 221 transitions. Word has length 91 [2019-10-02 16:19:38,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:19:38,185 INFO L475 AbstractCegarLoop]: Abstraction has 165 states and 221 transitions. [2019-10-02 16:19:38,185 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 16:19:38,185 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 221 transitions. [2019-10-02 16:19:38,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-10-02 16:19:38,187 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:19:38,188 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 16:19:38,188 INFO L418 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:19:38,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:19:38,188 INFO L82 PathProgramCache]: Analyzing trace with hash 1453730190, now seen corresponding path program 1 times [2019-10-02 16:19:38,189 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:19:38,189 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:19:38,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:19:38,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:19:38,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:19:38,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:19:38,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 16:19:38,308 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:19:38,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 16:19:38,309 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 16:19:38,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 16:19:38,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 16:19:38,310 INFO L87 Difference]: Start difference. First operand 165 states and 221 transitions. Second operand 5 states. [2019-10-02 16:19:38,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:19:38,697 INFO L93 Difference]: Finished difference Result 355 states and 496 transitions. [2019-10-02 16:19:38,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 16:19:38,697 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2019-10-02 16:19:38,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:19:38,700 INFO L225 Difference]: With dead ends: 355 [2019-10-02 16:19:38,700 INFO L226 Difference]: Without dead ends: 210 [2019-10-02 16:19:38,702 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 16:19:38,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2019-10-02 16:19:38,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 165. [2019-10-02 16:19:38,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-10-02 16:19:38,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 220 transitions. [2019-10-02 16:19:38,724 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 220 transitions. Word has length 91 [2019-10-02 16:19:38,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:19:38,724 INFO L475 AbstractCegarLoop]: Abstraction has 165 states and 220 transitions. [2019-10-02 16:19:38,724 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 16:19:38,725 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 220 transitions. [2019-10-02 16:19:38,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-10-02 16:19:38,726 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:19:38,727 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 16:19:38,727 INFO L418 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:19:38,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:19:38,727 INFO L82 PathProgramCache]: Analyzing trace with hash 721762764, now seen corresponding path program 1 times [2019-10-02 16:19:38,727 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:19:38,728 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:19:38,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:19:38,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:19:38,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:19:38,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:19:38,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 16:19:38,829 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:19:38,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 16:19:38,830 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 16:19:38,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 16:19:38,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 16:19:38,830 INFO L87 Difference]: Start difference. First operand 165 states and 220 transitions. Second operand 5 states. [2019-10-02 16:19:39,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:19:39,258 INFO L93 Difference]: Finished difference Result 349 states and 485 transitions. [2019-10-02 16:19:39,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 16:19:39,259 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2019-10-02 16:19:39,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:19:39,262 INFO L225 Difference]: With dead ends: 349 [2019-10-02 16:19:39,262 INFO L226 Difference]: Without dead ends: 204 [2019-10-02 16:19:39,263 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 16:19:39,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2019-10-02 16:19:39,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 165. [2019-10-02 16:19:39,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-10-02 16:19:39,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 219 transitions. [2019-10-02 16:19:39,285 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 219 transitions. Word has length 91 [2019-10-02 16:19:39,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:19:39,285 INFO L475 AbstractCegarLoop]: Abstraction has 165 states and 219 transitions. [2019-10-02 16:19:39,285 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 16:19:39,285 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 219 transitions. [2019-10-02 16:19:39,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-10-02 16:19:39,287 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:19:39,287 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 16:19:39,288 INFO L418 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:19:39,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:19:39,288 INFO L82 PathProgramCache]: Analyzing trace with hash -964417074, now seen corresponding path program 1 times [2019-10-02 16:19:39,288 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:19:39,288 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:19:39,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:19:39,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:19:39,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:19:39,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:19:39,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 16:19:39,386 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:19:39,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 16:19:39,390 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 16:19:39,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 16:19:39,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 16:19:39,391 INFO L87 Difference]: Start difference. First operand 165 states and 219 transitions. Second operand 5 states. [2019-10-02 16:19:39,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:19:39,768 INFO L93 Difference]: Finished difference Result 351 states and 484 transitions. [2019-10-02 16:19:39,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 16:19:39,768 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2019-10-02 16:19:39,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:19:39,772 INFO L225 Difference]: With dead ends: 351 [2019-10-02 16:19:39,772 INFO L226 Difference]: Without dead ends: 206 [2019-10-02 16:19:39,774 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 16:19:39,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2019-10-02 16:19:39,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 165. [2019-10-02 16:19:39,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-10-02 16:19:39,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 218 transitions. [2019-10-02 16:19:39,793 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 218 transitions. Word has length 91 [2019-10-02 16:19:39,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:19:39,794 INFO L475 AbstractCegarLoop]: Abstraction has 165 states and 218 transitions. [2019-10-02 16:19:39,794 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 16:19:39,794 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 218 transitions. [2019-10-02 16:19:39,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-10-02 16:19:39,795 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:19:39,796 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 16:19:39,796 INFO L418 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:19:39,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:19:39,796 INFO L82 PathProgramCache]: Analyzing trace with hash -1018809972, now seen corresponding path program 1 times [2019-10-02 16:19:39,797 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:19:39,797 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:19:39,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:19:39,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:19:39,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:19:39,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:19:39,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 16:19:39,861 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:19:39,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 16:19:39,861 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 16:19:39,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 16:19:39,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 16:19:39,862 INFO L87 Difference]: Start difference. First operand 165 states and 218 transitions. Second operand 4 states. [2019-10-02 16:19:40,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:19:40,086 INFO L93 Difference]: Finished difference Result 445 states and 615 transitions. [2019-10-02 16:19:40,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 16:19:40,087 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2019-10-02 16:19:40,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:19:40,090 INFO L225 Difference]: With dead ends: 445 [2019-10-02 16:19:40,090 INFO L226 Difference]: Without dead ends: 301 [2019-10-02 16:19:40,092 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 16:19:40,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2019-10-02 16:19:40,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 300. [2019-10-02 16:19:40,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2019-10-02 16:19:40,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 395 transitions. [2019-10-02 16:19:40,129 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 395 transitions. Word has length 91 [2019-10-02 16:19:40,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:19:40,129 INFO L475 AbstractCegarLoop]: Abstraction has 300 states and 395 transitions. [2019-10-02 16:19:40,130 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 16:19:40,130 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 395 transitions. [2019-10-02 16:19:40,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-10-02 16:19:40,132 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:19:40,133 INFO L411 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, 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] [2019-10-02 16:19:40,133 INFO L418 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:19:40,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:19:40,134 INFO L82 PathProgramCache]: Analyzing trace with hash -207780250, now seen corresponding path program 1 times [2019-10-02 16:19:40,134 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:19:40,134 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:19:40,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:19:40,136 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:19:40,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:19:40,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:19:40,228 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-10-02 16:19:40,229 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 16:19:40,230 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 16:19:40,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:19:40,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:19:40,384 INFO L256 TraceCheckSpWp]: Trace formula consists of 725 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 16:19:40,404 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 16:19:40,463 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-10-02 16:19:40,477 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 16:19:40,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2019-10-02 16:19:40,478 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 16:19:40,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 16:19:40,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 16:19:40,479 INFO L87 Difference]: Start difference. First operand 300 states and 395 transitions. Second operand 7 states. [2019-10-02 16:19:40,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:19:40,638 INFO L93 Difference]: Finished difference Result 875 states and 1233 transitions. [2019-10-02 16:19:40,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 16:19:40,638 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 145 [2019-10-02 16:19:40,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:19:40,643 INFO L225 Difference]: With dead ends: 875 [2019-10-02 16:19:40,644 INFO L226 Difference]: Without dead ends: 596 [2019-10-02 16:19:40,646 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-10-02 16:19:40,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2019-10-02 16:19:40,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 587. [2019-10-02 16:19:40,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 587 states. [2019-10-02 16:19:40,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 801 transitions. [2019-10-02 16:19:40,731 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 801 transitions. Word has length 145 [2019-10-02 16:19:40,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:19:40,731 INFO L475 AbstractCegarLoop]: Abstraction has 587 states and 801 transitions. [2019-10-02 16:19:40,731 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 16:19:40,732 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 801 transitions. [2019-10-02 16:19:40,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-10-02 16:19:40,736 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:19:40,736 INFO L411 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, 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] [2019-10-02 16:19:40,737 INFO L418 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:19:40,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:19:40,737 INFO L82 PathProgramCache]: Analyzing trace with hash -88135487, now seen corresponding path program 1 times [2019-10-02 16:19:40,738 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:19:40,738 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:19:40,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:19:40,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:19:40,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:19:40,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:19:40,834 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-10-02 16:19:40,835 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:19:40,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 16:19:40,835 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 16:19:40,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 16:19:40,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 16:19:40,836 INFO L87 Difference]: Start difference. First operand 587 states and 801 transitions. Second operand 4 states. [2019-10-02 16:19:40,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:19:40,990 INFO L93 Difference]: Finished difference Result 1147 states and 1563 transitions. [2019-10-02 16:19:40,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 16:19:40,991 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 145 [2019-10-02 16:19:40,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:19:40,998 INFO L225 Difference]: With dead ends: 1147 [2019-10-02 16:19:40,998 INFO L226 Difference]: Without dead ends: 581 [2019-10-02 16:19:41,001 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 16:19:41,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2019-10-02 16:19:41,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 581. [2019-10-02 16:19:41,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 581 states. [2019-10-02 16:19:41,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 581 states to 581 states and 789 transitions. [2019-10-02 16:19:41,067 INFO L78 Accepts]: Start accepts. Automaton has 581 states and 789 transitions. Word has length 145 [2019-10-02 16:19:41,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:19:41,067 INFO L475 AbstractCegarLoop]: Abstraction has 581 states and 789 transitions. [2019-10-02 16:19:41,067 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 16:19:41,068 INFO L276 IsEmpty]: Start isEmpty. Operand 581 states and 789 transitions. [2019-10-02 16:19:41,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-10-02 16:19:41,070 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:19:41,071 INFO L411 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, 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] [2019-10-02 16:19:41,071 INFO L418 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:19:41,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:19:41,071 INFO L82 PathProgramCache]: Analyzing trace with hash -819888643, now seen corresponding path program 1 times [2019-10-02 16:19:41,072 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:19:41,072 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:19:41,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:19:41,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:19:41,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:19:41,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:19:41,167 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-10-02 16:19:41,167 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 16:19:41,167 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 16:19:41,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:19:41,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:19:41,305 INFO L256 TraceCheckSpWp]: Trace formula consists of 734 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-02 16:19:41,311 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 16:19:41,354 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-10-02 16:19:41,367 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 16:19:41,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-10-02 16:19:41,370 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 16:19:41,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 16:19:41,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 16:19:41,371 INFO L87 Difference]: Start difference. First operand 581 states and 789 transitions. Second operand 5 states. [2019-10-02 16:19:42,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:19:42,020 INFO L93 Difference]: Finished difference Result 2697 states and 4099 transitions. [2019-10-02 16:19:42,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 16:19:42,021 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 146 [2019-10-02 16:19:42,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:19:42,038 INFO L225 Difference]: With dead ends: 2697 [2019-10-02 16:19:42,038 INFO L226 Difference]: Without dead ends: 2137 [2019-10-02 16:19:42,045 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 147 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-02 16:19:42,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2137 states. [2019-10-02 16:19:42,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2137 to 2114. [2019-10-02 16:19:42,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2114 states. [2019-10-02 16:19:42,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2114 states to 2114 states and 2975 transitions. [2019-10-02 16:19:42,237 INFO L78 Accepts]: Start accepts. Automaton has 2114 states and 2975 transitions. Word has length 146 [2019-10-02 16:19:42,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:19:42,238 INFO L475 AbstractCegarLoop]: Abstraction has 2114 states and 2975 transitions. [2019-10-02 16:19:42,238 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 16:19:42,238 INFO L276 IsEmpty]: Start isEmpty. Operand 2114 states and 2975 transitions. [2019-10-02 16:19:42,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-10-02 16:19:42,249 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:19:42,249 INFO L411 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, 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, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 16:19:42,250 INFO L418 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:19:42,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:19:42,250 INFO L82 PathProgramCache]: Analyzing trace with hash -119316499, now seen corresponding path program 1 times [2019-10-02 16:19:42,250 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:19:42,251 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:19:42,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:19:42,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:19:42,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:19:42,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:19:42,353 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-10-02 16:19:42,354 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:19:42,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 16:19:42,354 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 16:19:42,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 16:19:42,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 16:19:42,356 INFO L87 Difference]: Start difference. First operand 2114 states and 2975 transitions. Second operand 5 states. [2019-10-02 16:19:43,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:19:43,144 INFO L93 Difference]: Finished difference Result 5475 states and 7881 transitions. [2019-10-02 16:19:43,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 16:19:43,145 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 189 [2019-10-02 16:19:43,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:19:43,186 INFO L225 Difference]: With dead ends: 5475 [2019-10-02 16:19:43,186 INFO L226 Difference]: Without dead ends: 3390 [2019-10-02 16:19:43,205 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-02 16:19:43,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3390 states. [2019-10-02 16:19:43,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3390 to 3022. [2019-10-02 16:19:43,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3022 states. [2019-10-02 16:19:43,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3022 states to 3022 states and 4127 transitions. [2019-10-02 16:19:43,543 INFO L78 Accepts]: Start accepts. Automaton has 3022 states and 4127 transitions. Word has length 189 [2019-10-02 16:19:43,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:19:43,543 INFO L475 AbstractCegarLoop]: Abstraction has 3022 states and 4127 transitions. [2019-10-02 16:19:43,543 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 16:19:43,543 INFO L276 IsEmpty]: Start isEmpty. Operand 3022 states and 4127 transitions. [2019-10-02 16:19:43,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-10-02 16:19:43,555 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:19:43,555 INFO L411 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 16:19:43,555 INFO L418 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:19:43,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:19:43,556 INFO L82 PathProgramCache]: Analyzing trace with hash -191708334, now seen corresponding path program 1 times [2019-10-02 16:19:43,556 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:19:43,556 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:19:43,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:19:43,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:19:43,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:19:43,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:19:43,666 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2019-10-02 16:19:43,666 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:19:43,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 16:19:43,667 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 16:19:43,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 16:19:43,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 16:19:43,667 INFO L87 Difference]: Start difference. First operand 3022 states and 4127 transitions. Second operand 4 states. [2019-10-02 16:19:43,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:19:43,913 INFO L93 Difference]: Finished difference Result 5290 states and 7189 transitions. [2019-10-02 16:19:43,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 16:19:43,914 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 189 [2019-10-02 16:19:43,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:19:43,931 INFO L225 Difference]: With dead ends: 5290 [2019-10-02 16:19:43,931 INFO L226 Difference]: Without dead ends: 2290 [2019-10-02 16:19:43,945 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 16:19:43,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2290 states. [2019-10-02 16:19:44,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2290 to 2290. [2019-10-02 16:19:44,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2290 states. [2019-10-02 16:19:44,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2290 states to 2290 states and 3092 transitions. [2019-10-02 16:19:44,188 INFO L78 Accepts]: Start accepts. Automaton has 2290 states and 3092 transitions. Word has length 189 [2019-10-02 16:19:44,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:19:44,188 INFO L475 AbstractCegarLoop]: Abstraction has 2290 states and 3092 transitions. [2019-10-02 16:19:44,189 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 16:19:44,189 INFO L276 IsEmpty]: Start isEmpty. Operand 2290 states and 3092 transitions. [2019-10-02 16:19:44,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-10-02 16:19:44,201 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:19:44,201 INFO L411 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, 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, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 16:19:44,202 INFO L418 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:19:44,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:19:44,202 INFO L82 PathProgramCache]: Analyzing trace with hash -553822097, now seen corresponding path program 1 times [2019-10-02 16:19:44,203 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:19:44,203 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:19:44,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:19:44,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:19:44,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:19:44,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:19:44,353 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-10-02 16:19:44,354 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:19:44,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 16:19:44,355 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 16:19:44,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 16:19:44,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 16:19:44,356 INFO L87 Difference]: Start difference. First operand 2290 states and 3092 transitions. Second operand 5 states. [2019-10-02 16:19:44,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:19:44,922 INFO L93 Difference]: Finished difference Result 4556 states and 6200 transitions. [2019-10-02 16:19:44,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 16:19:44,922 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 189 [2019-10-02 16:19:44,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:19:44,938 INFO L225 Difference]: With dead ends: 4556 [2019-10-02 16:19:44,938 INFO L226 Difference]: Without dead ends: 2290 [2019-10-02 16:19:44,948 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 16:19:44,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2290 states. [2019-10-02 16:19:45,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2290 to 2290. [2019-10-02 16:19:45,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2290 states. [2019-10-02 16:19:45,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2290 states to 2290 states and 3056 transitions. [2019-10-02 16:19:45,135 INFO L78 Accepts]: Start accepts. Automaton has 2290 states and 3056 transitions. Word has length 189 [2019-10-02 16:19:45,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:19:45,139 INFO L475 AbstractCegarLoop]: Abstraction has 2290 states and 3056 transitions. [2019-10-02 16:19:45,139 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 16:19:45,139 INFO L276 IsEmpty]: Start isEmpty. Operand 2290 states and 3056 transitions. [2019-10-02 16:19:45,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-10-02 16:19:45,147 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:19:45,148 INFO L411 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, 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, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 16:19:45,148 INFO L418 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:19:45,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:19:45,149 INFO L82 PathProgramCache]: Analyzing trace with hash -1260418703, now seen corresponding path program 1 times [2019-10-02 16:19:45,149 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:19:45,149 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:19:45,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:19:45,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:19:45,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:19:45,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:19:45,242 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-10-02 16:19:45,243 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:19:45,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 16:19:45,244 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 16:19:45,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 16:19:45,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 16:19:45,245 INFO L87 Difference]: Start difference. First operand 2290 states and 3056 transitions. Second operand 5 states. [2019-10-02 16:19:46,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:19:46,027 INFO L93 Difference]: Finished difference Result 5038 states and 7256 transitions. [2019-10-02 16:19:46,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 16:19:46,028 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 189 [2019-10-02 16:19:46,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:19:46,048 INFO L225 Difference]: With dead ends: 5038 [2019-10-02 16:19:46,048 INFO L226 Difference]: Without dead ends: 2772 [2019-10-02 16:19:46,062 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-02 16:19:46,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2772 states. [2019-10-02 16:19:46,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2772 to 2568. [2019-10-02 16:19:46,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2568 states. [2019-10-02 16:19:46,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2568 states to 2568 states and 3344 transitions. [2019-10-02 16:19:46,262 INFO L78 Accepts]: Start accepts. Automaton has 2568 states and 3344 transitions. Word has length 189 [2019-10-02 16:19:46,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:19:46,263 INFO L475 AbstractCegarLoop]: Abstraction has 2568 states and 3344 transitions. [2019-10-02 16:19:46,263 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 16:19:46,263 INFO L276 IsEmpty]: Start isEmpty. Operand 2568 states and 3344 transitions. [2019-10-02 16:19:46,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-10-02 16:19:46,272 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:19:46,273 INFO L411 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, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 16:19:46,273 INFO L418 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:19:46,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:19:46,273 INFO L82 PathProgramCache]: Analyzing trace with hash -1217472109, now seen corresponding path program 1 times [2019-10-02 16:19:46,274 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:19:46,274 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:19:46,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:19:46,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:19:46,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:19:46,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:19:46,406 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-10-02 16:19:46,406 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:19:46,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 16:19:46,408 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 16:19:46,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 16:19:46,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 16:19:46,409 INFO L87 Difference]: Start difference. First operand 2568 states and 3344 transitions. Second operand 5 states. [2019-10-02 16:19:47,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:19:47,147 INFO L93 Difference]: Finished difference Result 5441 states and 7408 transitions. [2019-10-02 16:19:47,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 16:19:47,148 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 190 [2019-10-02 16:19:47,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:19:47,166 INFO L225 Difference]: With dead ends: 5441 [2019-10-02 16:19:47,166 INFO L226 Difference]: Without dead ends: 2895 [2019-10-02 16:19:47,179 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-02 16:19:47,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2895 states. [2019-10-02 16:19:47,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2895 to 2825. [2019-10-02 16:19:47,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2825 states. [2019-10-02 16:19:47,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2825 states to 2825 states and 3566 transitions. [2019-10-02 16:19:47,388 INFO L78 Accepts]: Start accepts. Automaton has 2825 states and 3566 transitions. Word has length 190 [2019-10-02 16:19:47,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:19:47,388 INFO L475 AbstractCegarLoop]: Abstraction has 2825 states and 3566 transitions. [2019-10-02 16:19:47,388 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 16:19:47,388 INFO L276 IsEmpty]: Start isEmpty. Operand 2825 states and 3566 transitions. [2019-10-02 16:19:47,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-10-02 16:19:47,397 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:19:47,397 INFO L411 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 16:19:47,398 INFO L418 AbstractCegarLoop]: === Iteration 15 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:19:47,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:19:47,398 INFO L82 PathProgramCache]: Analyzing trace with hash -1858380762, now seen corresponding path program 1 times [2019-10-02 16:19:47,398 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:19:47,398 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:19:47,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:19:47,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:19:47,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:19:47,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:19:47,498 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-10-02 16:19:47,500 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:19:47,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 16:19:47,500 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 16:19:47,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 16:19:47,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 16:19:47,501 INFO L87 Difference]: Start difference. First operand 2825 states and 3566 transitions. Second operand 5 states. [2019-10-02 16:19:48,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:19:48,150 INFO L93 Difference]: Finished difference Result 6327 states and 8919 transitions. [2019-10-02 16:19:48,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 16:19:48,151 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 191 [2019-10-02 16:19:48,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:19:48,223 INFO L225 Difference]: With dead ends: 6327 [2019-10-02 16:19:48,223 INFO L226 Difference]: Without dead ends: 3526 [2019-10-02 16:19:48,239 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-02 16:19:48,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3526 states. [2019-10-02 16:19:48,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3526 to 3107. [2019-10-02 16:19:48,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3107 states. [2019-10-02 16:19:48,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3107 states to 3107 states and 3874 transitions. [2019-10-02 16:19:48,499 INFO L78 Accepts]: Start accepts. Automaton has 3107 states and 3874 transitions. Word has length 191 [2019-10-02 16:19:48,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:19:48,500 INFO L475 AbstractCegarLoop]: Abstraction has 3107 states and 3874 transitions. [2019-10-02 16:19:48,500 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 16:19:48,500 INFO L276 IsEmpty]: Start isEmpty. Operand 3107 states and 3874 transitions. [2019-10-02 16:19:48,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-10-02 16:19:48,515 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:19:48,515 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 16:19:48,516 INFO L418 AbstractCegarLoop]: === Iteration 16 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:19:48,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:19:48,516 INFO L82 PathProgramCache]: Analyzing trace with hash 555577967, now seen corresponding path program 1 times [2019-10-02 16:19:48,516 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:19:48,516 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:19:48,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:19:48,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:19:48,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:19:48,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:19:48,630 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2019-10-02 16:19:48,630 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 16:19:48,630 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 16:19:48,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:19:48,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:19:48,813 INFO L256 TraceCheckSpWp]: Trace formula consists of 995 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 16:19:48,830 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 16:19:48,887 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2019-10-02 16:19:48,901 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 16:19:48,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 3 [2019-10-02 16:19:48,904 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 16:19:48,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 16:19:48,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 16:19:48,905 INFO L87 Difference]: Start difference. First operand 3107 states and 3874 transitions. Second operand 3 states. [2019-10-02 16:19:49,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:19:49,126 INFO L93 Difference]: Finished difference Result 6630 states and 8367 transitions. [2019-10-02 16:19:49,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 16:19:49,126 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 246 [2019-10-02 16:19:49,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:19:49,149 INFO L225 Difference]: With dead ends: 6630 [2019-10-02 16:19:49,149 INFO L226 Difference]: Without dead ends: 3547 [2019-10-02 16:19:49,167 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 247 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 16:19:49,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3547 states. [2019-10-02 16:19:49,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3547 to 3183. [2019-10-02 16:19:49,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3183 states. [2019-10-02 16:19:49,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3183 states to 3183 states and 3914 transitions. [2019-10-02 16:19:49,486 INFO L78 Accepts]: Start accepts. Automaton has 3183 states and 3914 transitions. Word has length 246 [2019-10-02 16:19:49,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:19:49,488 INFO L475 AbstractCegarLoop]: Abstraction has 3183 states and 3914 transitions. [2019-10-02 16:19:49,489 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 16:19:49,489 INFO L276 IsEmpty]: Start isEmpty. Operand 3183 states and 3914 transitions. [2019-10-02 16:19:49,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-10-02 16:19:49,497 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:19:49,497 INFO L411 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 16:19:49,497 INFO L418 AbstractCegarLoop]: === Iteration 17 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:19:49,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:19:49,498 INFO L82 PathProgramCache]: Analyzing trace with hash 1029239138, now seen corresponding path program 1 times [2019-10-02 16:19:49,498 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:19:49,498 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:19:49,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:19:49,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:19:49,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:19:49,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:19:49,591 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 21 proven. 15 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-10-02 16:19:49,591 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 16:19:49,591 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-02 16:19:49,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 16:19:49,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:19:49,729 INFO L256 TraceCheckSpWp]: Trace formula consists of 842 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 16:19:49,734 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 16:19:49,769 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-10-02 16:19:49,776 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 16:19:49,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2019-10-02 16:19:49,777 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 16:19:49,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 16:19:49,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 16:19:49,779 INFO L87 Difference]: Start difference. First operand 3183 states and 3914 transitions. Second operand 7 states. [2019-10-02 16:19:50,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:19:50,052 INFO L93 Difference]: Finished difference Result 5740 states and 7214 transitions. [2019-10-02 16:19:50,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 16:19:50,053 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 191 [2019-10-02 16:19:50,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:19:50,069 INFO L225 Difference]: With dead ends: 5740 [2019-10-02 16:19:50,069 INFO L226 Difference]: Without dead ends: 2579 [2019-10-02 16:19:50,081 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-10-02 16:19:50,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2579 states. [2019-10-02 16:19:50,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2579 to 2521. [2019-10-02 16:19:50,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2521 states. [2019-10-02 16:19:50,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2521 states to 2521 states and 2975 transitions. [2019-10-02 16:19:50,268 INFO L78 Accepts]: Start accepts. Automaton has 2521 states and 2975 transitions. Word has length 191 [2019-10-02 16:19:50,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:19:50,268 INFO L475 AbstractCegarLoop]: Abstraction has 2521 states and 2975 transitions. [2019-10-02 16:19:50,268 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 16:19:50,268 INFO L276 IsEmpty]: Start isEmpty. Operand 2521 states and 2975 transitions. [2019-10-02 16:19:50,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-10-02 16:19:50,276 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:19:50,277 INFO L411 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 16:19:50,277 INFO L418 AbstractCegarLoop]: === Iteration 18 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:19:50,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:19:50,277 INFO L82 PathProgramCache]: Analyzing trace with hash -2146588841, now seen corresponding path program 1 times [2019-10-02 16:19:50,278 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:19:50,278 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:19:50,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:19:50,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:19:50,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:19:50,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:19:50,449 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 23 proven. 2 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-10-02 16:19:50,450 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 16:19:50,450 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 16:19:50,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:19:50,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:19:50,605 INFO L256 TraceCheckSpWp]: Trace formula consists of 921 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-02 16:19:50,609 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 16:19:50,654 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 16:19:50,664 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 16:19:50,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 3 [2019-10-02 16:19:50,666 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 16:19:50,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 16:19:50,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 16:19:50,667 INFO L87 Difference]: Start difference. First operand 2521 states and 2975 transitions. Second operand 3 states. [2019-10-02 16:19:51,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:19:51,078 INFO L93 Difference]: Finished difference Result 7184 states and 8862 transitions. [2019-10-02 16:19:51,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 16:19:51,078 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 212 [2019-10-02 16:19:51,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:19:51,114 INFO L225 Difference]: With dead ends: 7184 [2019-10-02 16:19:51,114 INFO L226 Difference]: Without dead ends: 4687 [2019-10-02 16:19:51,131 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 16:19:51,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4687 states. [2019-10-02 16:19:51,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4687 to 4680. [2019-10-02 16:19:51,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4680 states. [2019-10-02 16:19:51,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4680 states to 4680 states and 5738 transitions. [2019-10-02 16:19:51,605 INFO L78 Accepts]: Start accepts. Automaton has 4680 states and 5738 transitions. Word has length 212 [2019-10-02 16:19:51,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:19:51,606 INFO L475 AbstractCegarLoop]: Abstraction has 4680 states and 5738 transitions. [2019-10-02 16:19:51,606 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 16:19:51,607 INFO L276 IsEmpty]: Start isEmpty. Operand 4680 states and 5738 transitions. [2019-10-02 16:19:51,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2019-10-02 16:19:51,627 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:19:51,627 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 16:19:51,628 INFO L418 AbstractCegarLoop]: === Iteration 19 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:19:51,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:19:51,628 INFO L82 PathProgramCache]: Analyzing trace with hash -1750642282, now seen corresponding path program 1 times [2019-10-02 16:19:51,628 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:19:51,629 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:19:51,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:19:51,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:19:51,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:19:51,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:19:51,873 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 228 trivial. 0 not checked. [2019-10-02 16:19:51,873 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:19:51,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 16:19:51,875 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 16:19:51,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 16:19:51,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 16:19:51,877 INFO L87 Difference]: Start difference. First operand 4680 states and 5738 transitions. Second operand 4 states. [2019-10-02 16:19:52,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:19:52,309 INFO L93 Difference]: Finished difference Result 8505 states and 10392 transitions. [2019-10-02 16:19:52,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 16:19:52,310 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 256 [2019-10-02 16:19:52,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:19:52,347 INFO L225 Difference]: With dead ends: 8505 [2019-10-02 16:19:52,347 INFO L226 Difference]: Without dead ends: 3847 [2019-10-02 16:19:52,368 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 16:19:52,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3847 states. [2019-10-02 16:19:52,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3847 to 3847. [2019-10-02 16:19:52,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3847 states. [2019-10-02 16:19:52,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3847 states to 3847 states and 4681 transitions. [2019-10-02 16:19:52,749 INFO L78 Accepts]: Start accepts. Automaton has 3847 states and 4681 transitions. Word has length 256 [2019-10-02 16:19:52,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:19:52,750 INFO L475 AbstractCegarLoop]: Abstraction has 3847 states and 4681 transitions. [2019-10-02 16:19:52,750 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 16:19:52,750 INFO L276 IsEmpty]: Start isEmpty. Operand 3847 states and 4681 transitions. [2019-10-02 16:19:52,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2019-10-02 16:19:52,764 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:19:52,765 INFO L411 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 16:19:52,765 INFO L418 AbstractCegarLoop]: === Iteration 20 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:19:52,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:19:52,766 INFO L82 PathProgramCache]: Analyzing trace with hash 547975687, now seen corresponding path program 1 times [2019-10-02 16:19:52,766 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:19:52,766 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:19:52,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:19:52,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:19:52,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:19:52,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:19:52,890 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 26 proven. 9 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2019-10-02 16:19:52,892 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 16:19:52,892 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 16:19:52,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:19:53,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:19:53,045 INFO L256 TraceCheckSpWp]: Trace formula consists of 930 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-02 16:19:53,049 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 16:19:53,077 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-02 16:19:53,087 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 16:19:53,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 6 [2019-10-02 16:19:53,088 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 16:19:53,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 16:19:53,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 16:19:53,088 INFO L87 Difference]: Start difference. First operand 3847 states and 4681 transitions. Second operand 6 states. [2019-10-02 16:19:53,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:19:53,523 INFO L93 Difference]: Finished difference Result 7678 states and 9700 transitions. [2019-10-02 16:19:53,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 16:19:53,523 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 213 [2019-10-02 16:19:53,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:19:53,544 INFO L225 Difference]: With dead ends: 7678 [2019-10-02 16:19:53,544 INFO L226 Difference]: Without dead ends: 3853 [2019-10-02 16:19:53,563 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 214 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-02 16:19:53,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3853 states. [2019-10-02 16:19:53,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3853 to 3853. [2019-10-02 16:19:53,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3853 states. [2019-10-02 16:19:53,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3853 states to 3853 states and 4578 transitions. [2019-10-02 16:19:53,882 INFO L78 Accepts]: Start accepts. Automaton has 3853 states and 4578 transitions. Word has length 213 [2019-10-02 16:19:53,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:19:53,883 INFO L475 AbstractCegarLoop]: Abstraction has 3853 states and 4578 transitions. [2019-10-02 16:19:53,883 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 16:19:53,883 INFO L276 IsEmpty]: Start isEmpty. Operand 3853 states and 4578 transitions. [2019-10-02 16:19:53,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2019-10-02 16:19:53,897 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:19:53,898 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 16:19:53,898 INFO L418 AbstractCegarLoop]: === Iteration 21 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:19:53,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:19:53,898 INFO L82 PathProgramCache]: Analyzing trace with hash -1253345058, now seen corresponding path program 1 times [2019-10-02 16:19:53,899 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:19:53,899 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:19:53,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:19:53,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:19:53,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:19:53,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:19:54,066 INFO L134 CoverageAnalysis]: Checked inductivity of 447 backedges. 30 proven. 26 refuted. 0 times theorem prover too weak. 391 trivial. 0 not checked. [2019-10-02 16:19:54,066 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 16:19:54,066 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 16:19:54,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:19:54,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:19:54,314 INFO L256 TraceCheckSpWp]: Trace formula consists of 1333 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 16:19:54,324 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 16:19:54,445 INFO L134 CoverageAnalysis]: Checked inductivity of 447 backedges. 249 proven. 0 refuted. 0 times theorem prover too weak. 198 trivial. 0 not checked. [2019-10-02 16:19:54,459 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 16:19:54,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2019-10-02 16:19:54,460 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 16:19:54,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 16:19:54,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-10-02 16:19:54,462 INFO L87 Difference]: Start difference. First operand 3853 states and 4578 transitions. Second operand 9 states. [2019-10-02 16:19:55,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:19:55,038 INFO L93 Difference]: Finished difference Result 6506 states and 8066 transitions. [2019-10-02 16:19:55,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-02 16:19:55,039 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 350 [2019-10-02 16:19:55,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:19:55,050 INFO L225 Difference]: With dead ends: 6506 [2019-10-02 16:19:55,051 INFO L226 Difference]: Without dead ends: 2677 [2019-10-02 16:19:55,061 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 356 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=233, Unknown=0, NotChecked=0, Total=306 [2019-10-02 16:19:55,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2677 states. [2019-10-02 16:19:55,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2677 to 2474. [2019-10-02 16:19:55,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2474 states. [2019-10-02 16:19:55,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2474 states to 2474 states and 2806 transitions. [2019-10-02 16:19:55,301 INFO L78 Accepts]: Start accepts. Automaton has 2474 states and 2806 transitions. Word has length 350 [2019-10-02 16:19:55,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:19:55,301 INFO L475 AbstractCegarLoop]: Abstraction has 2474 states and 2806 transitions. [2019-10-02 16:19:55,301 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 16:19:55,301 INFO L276 IsEmpty]: Start isEmpty. Operand 2474 states and 2806 transitions. [2019-10-02 16:19:55,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2019-10-02 16:19:55,310 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:19:55,311 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 16:19:55,311 INFO L418 AbstractCegarLoop]: === Iteration 22 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:19:55,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:19:55,311 INFO L82 PathProgramCache]: Analyzing trace with hash 2119960705, now seen corresponding path program 1 times [2019-10-02 16:19:55,312 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:19:55,312 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:19:55,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:19:55,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:19:55,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:19:55,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:19:55,425 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 1 proven. 35 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2019-10-02 16:19:55,425 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 16:19:55,425 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 16:19:55,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:19:55,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:19:55,591 INFO L256 TraceCheckSpWp]: Trace formula consists of 1064 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-02 16:19:55,597 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 16:19:55,686 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 193 trivial. 0 not checked. [2019-10-02 16:19:55,700 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 16:19:55,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-10-02 16:19:55,701 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 16:19:55,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 16:19:55,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-02 16:19:55,702 INFO L87 Difference]: Start difference. First operand 2474 states and 2806 transitions. Second operand 5 states. [2019-10-02 16:19:56,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:19:56,090 INFO L93 Difference]: Finished difference Result 4608 states and 5222 transitions. [2019-10-02 16:19:56,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 16:19:56,092 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 259 [2019-10-02 16:19:56,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:19:56,101 INFO L225 Difference]: With dead ends: 4608 [2019-10-02 16:19:56,102 INFO L226 Difference]: Without dead ends: 2424 [2019-10-02 16:19:56,107 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 260 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-02 16:19:56,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2424 states. [2019-10-02 16:19:56,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2424 to 2416. [2019-10-02 16:19:56,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2416 states. [2019-10-02 16:19:56,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2416 states to 2416 states and 2721 transitions. [2019-10-02 16:19:56,296 INFO L78 Accepts]: Start accepts. Automaton has 2416 states and 2721 transitions. Word has length 259 [2019-10-02 16:19:56,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:19:56,297 INFO L475 AbstractCegarLoop]: Abstraction has 2416 states and 2721 transitions. [2019-10-02 16:19:56,297 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 16:19:56,297 INFO L276 IsEmpty]: Start isEmpty. Operand 2416 states and 2721 transitions. [2019-10-02 16:19:56,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2019-10-02 16:19:56,305 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:19:56,305 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 16:19:56,306 INFO L418 AbstractCegarLoop]: === Iteration 23 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:19:56,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:19:56,306 INFO L82 PathProgramCache]: Analyzing trace with hash 1496402789, now seen corresponding path program 1 times [2019-10-02 16:19:56,306 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:19:56,306 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:19:56,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:19:56,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:19:56,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:19:56,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:19:56,533 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 24 proven. 10 refuted. 0 times theorem prover too weak. 201 trivial. 0 not checked. [2019-10-02 16:19:56,533 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 16:19:56,533 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-02 16:19:56,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 16:19:56,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:19:56,685 INFO L256 TraceCheckSpWp]: Trace formula consists of 1093 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 16:19:56,690 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 16:19:56,746 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 165 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (10)] Exception during sending of exit command (exit): Stream closed [2019-10-02 16:19:56,751 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 16:19:56,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2019-10-02 16:19:56,753 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 16:19:56,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 16:19:56,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-02 16:19:56,753 INFO L87 Difference]: Start difference. First operand 2416 states and 2721 transitions. Second operand 7 states. [2019-10-02 16:19:57,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:19:57,464 INFO L93 Difference]: Finished difference Result 3439 states and 3931 transitions. [2019-10-02 16:19:57,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 16:19:57,465 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 264 [2019-10-02 16:19:57,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:19:57,471 INFO L225 Difference]: With dead ends: 3439 [2019-10-02 16:19:57,472 INFO L226 Difference]: Without dead ends: 676 [2019-10-02 16:19:57,481 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 267 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2019-10-02 16:19:57,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2019-10-02 16:19:57,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 646. [2019-10-02 16:19:57,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 646 states. [2019-10-02 16:19:57,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 696 transitions. [2019-10-02 16:19:57,565 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 696 transitions. Word has length 264 [2019-10-02 16:19:57,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:19:57,566 INFO L475 AbstractCegarLoop]: Abstraction has 646 states and 696 transitions. [2019-10-02 16:19:57,567 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 16:19:57,567 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 696 transitions. [2019-10-02 16:19:57,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2019-10-02 16:19:57,571 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:19:57,572 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 16:19:57,572 INFO L418 AbstractCegarLoop]: === Iteration 24 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:19:57,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:19:57,573 INFO L82 PathProgramCache]: Analyzing trace with hash -2108904620, now seen corresponding path program 1 times [2019-10-02 16:19:57,573 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:19:57,573 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:19:57,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:19:57,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:19:57,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:19:57,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:19:57,822 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2019-10-02 16:19:57,823 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:19:57,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 16:19:57,823 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 16:19:57,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 16:19:57,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 16:19:57,824 INFO L87 Difference]: Start difference. First operand 646 states and 696 transitions. Second operand 7 states. [2019-10-02 16:19:58,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:19:58,784 INFO L93 Difference]: Finished difference Result 660 states and 713 transitions. [2019-10-02 16:19:58,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 16:19:58,785 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 265 [2019-10-02 16:19:58,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:19:58,787 INFO L225 Difference]: With dead ends: 660 [2019-10-02 16:19:58,787 INFO L226 Difference]: Without dead ends: 0 [2019-10-02 16:19:58,791 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2019-10-02 16:19:58,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-02 16:19:58,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-02 16:19:58,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-02 16:19:58,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-02 16:19:58,792 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 265 [2019-10-02 16:19:58,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:19:58,792 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-02 16:19:58,792 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 16:19:58,793 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-02 16:19:58,793 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-02 16:19:58,799 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-02 16:19:58,988 WARN L191 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 92 [2019-10-02 16:19:59,865 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2019-10-02 16:20:02,318 WARN L191 SmtUtils]: Spent 259.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2019-10-02 16:20:03,486 WARN L191 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 176 DAG size of output: 166 [2019-10-02 16:20:03,676 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 146 [2019-10-02 16:20:04,323 WARN L191 SmtUtils]: Spent 630.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 104 [2019-10-02 16:20:07,279 WARN L191 SmtUtils]: Spent 2.85 s on a formula simplification. DAG size of input: 190 DAG size of output: 95 [2019-10-02 16:20:07,913 WARN L191 SmtUtils]: Spent 631.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 104 [2019-10-02 16:20:08,736 WARN L191 SmtUtils]: Spent 819.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 77 [2019-10-02 16:20:10,109 WARN L191 SmtUtils]: Spent 1.37 s on a formula simplification. DAG size of input: 134 DAG size of output: 104 [2019-10-02 16:20:11,032 WARN L191 SmtUtils]: Spent 919.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 86 [2019-10-02 16:20:11,236 WARN L191 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 80 [2019-10-02 16:20:12,008 WARN L191 SmtUtils]: Spent 770.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 114 [2019-10-02 16:20:12,209 WARN L191 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 77 [2019-10-02 16:20:12,441 WARN L191 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 83 [2019-10-02 16:20:12,674 WARN L191 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 77 [2019-10-02 16:20:12,906 WARN L191 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 187 DAG size of output: 1 [2019-10-02 16:20:13,342 WARN L191 SmtUtils]: Spent 365.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 91 [2019-10-02 16:20:14,431 WARN L191 SmtUtils]: Spent 1.08 s on a formula simplification. DAG size of input: 119 DAG size of output: 86 [2019-10-02 16:20:15,076 WARN L191 SmtUtils]: Spent 639.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 104 [2019-10-02 16:20:15,767 WARN L191 SmtUtils]: Spent 688.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 77 [2019-10-02 16:20:16,540 WARN L191 SmtUtils]: Spent 771.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 114 [2019-10-02 16:20:17,637 WARN L191 SmtUtils]: Spent 1.09 s on a formula simplification. DAG size of input: 142 DAG size of output: 100 [2019-10-02 16:20:18,550 WARN L191 SmtUtils]: Spent 909.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 82 [2019-10-02 16:20:18,765 WARN L191 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 75 [2019-10-02 16:20:19,879 WARN L191 SmtUtils]: Spent 1.11 s on a formula simplification. DAG size of input: 116 DAG size of output: 92 [2019-10-02 16:20:21,654 WARN L191 SmtUtils]: Spent 1.77 s on a formula simplification. DAG size of input: 147 DAG size of output: 96 [2019-10-02 16:20:22,426 WARN L191 SmtUtils]: Spent 769.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 80 [2019-10-02 16:20:24,451 WARN L191 SmtUtils]: Spent 1.95 s on a formula simplification. DAG size of input: 155 DAG size of output: 102 [2019-10-02 16:20:26,744 WARN L191 SmtUtils]: Spent 2.28 s on a formula simplification. DAG size of input: 143 DAG size of output: 92 [2019-10-02 16:20:26,899 WARN L191 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 52 [2019-10-02 16:20:27,532 WARN L191 SmtUtils]: Spent 631.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 104 [2019-10-02 16:20:28,459 WARN L191 SmtUtils]: Spent 923.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 80 [2019-10-02 16:20:29,648 WARN L191 SmtUtils]: Spent 1.18 s on a formula simplification. DAG size of input: 124 DAG size of output: 92 [2019-10-02 16:20:30,327 WARN L191 SmtUtils]: Spent 675.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 80 [2019-10-02 16:20:30,909 WARN L191 SmtUtils]: Spent 499.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 64 [2019-10-02 16:20:32,088 WARN L191 SmtUtils]: Spent 1.18 s on a formula simplification. DAG size of input: 161 DAG size of output: 135 [2019-10-02 16:20:34,220 WARN L191 SmtUtils]: Spent 2.12 s on a formula simplification. DAG size of input: 140 DAG size of output: 83 [2019-10-02 16:20:34,406 WARN L191 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 75 [2019-10-02 16:20:34,597 WARN L191 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 77 [2019-10-02 16:20:36,330 WARN L191 SmtUtils]: Spent 1.73 s on a formula simplification. DAG size of input: 176 DAG size of output: 140 [2019-10-02 16:20:36,546 WARN L191 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 83 [2019-10-02 16:20:37,067 WARN L191 SmtUtils]: Spent 518.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 91 [2019-10-02 16:20:39,003 WARN L191 SmtUtils]: Spent 1.93 s on a formula simplification. DAG size of input: 129 DAG size of output: 75 [2019-10-02 16:20:39,954 WARN L191 SmtUtils]: Spent 946.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 80 [2019-10-02 16:20:40,859 WARN L191 SmtUtils]: Spent 901.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 86 [2019-10-02 16:20:40,988 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 1 [2019-10-02 16:20:41,795 WARN L191 SmtUtils]: Spent 803.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 103 [2019-10-02 16:20:43,298 WARN L191 SmtUtils]: Spent 1.50 s on a formula simplification. DAG size of input: 124 DAG size of output: 84 [2019-10-02 16:20:43,996 WARN L191 SmtUtils]: Spent 695.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 69 [2019-10-02 16:20:44,583 WARN L191 SmtUtils]: Spent 584.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 79 [2019-10-02 16:20:46,937 WARN L191 SmtUtils]: Spent 2.35 s on a formula simplification. DAG size of input: 143 DAG size of output: 92 [2019-10-02 16:20:47,064 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 1 [2019-10-02 16:20:48,589 WARN L191 SmtUtils]: Spent 1.38 s on a formula simplification. DAG size of input: 146 DAG size of output: 123 [2019-10-02 16:20:48,752 WARN L191 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 54 [2019-10-02 16:20:48,941 WARN L191 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 77 [2019-10-02 16:20:51,878 WARN L191 SmtUtils]: Spent 2.93 s on a formula simplification. DAG size of input: 240 DAG size of output: 166 [2019-10-02 16:20:52,521 WARN L191 SmtUtils]: Spent 639.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 58 [2019-10-02 16:20:53,577 WARN L191 SmtUtils]: Spent 1.05 s on a formula simplification. DAG size of input: 112 DAG size of output: 99 [2019-10-02 16:20:54,225 WARN L191 SmtUtils]: Spent 645.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 104 [2019-10-02 16:20:56,117 WARN L191 SmtUtils]: Spent 1.89 s on a formula simplification. DAG size of input: 142 DAG size of output: 83 [2019-10-02 16:20:56,490 WARN L191 SmtUtils]: Spent 371.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 91 [2019-10-02 16:20:57,002 WARN L191 SmtUtils]: Spent 510.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 91 [2019-10-02 16:20:58,502 WARN L191 SmtUtils]: Spent 1.50 s on a formula simplification. DAG size of input: 162 DAG size of output: 131 [2019-10-02 16:20:59,600 WARN L191 SmtUtils]: Spent 1.09 s on a formula simplification. DAG size of input: 115 DAG size of output: 83 [2019-10-02 16:21:02,582 WARN L191 SmtUtils]: Spent 2.98 s on a formula simplification. DAG size of input: 240 DAG size of output: 166 [2019-10-02 16:21:02,587 INFO L439 ceAbstractionStarter]: At program point L95-1(lines 83 114) the Hoare annotation is: (let ((.cse8 (= ~T1_E~0 0))) (let ((.cse28 (= 1 ~m_pc~0)) (.cse34 (= 1 ~t2_pc~0)) (.cse0 (= |old(~t1_st~0)| ~t1_st~0)) (.cse6 (= 1 ~t1_pc~0)) (.cse1 (<= ~t1_pc~0 0)) (.cse2 (not (= 1 ~E_2~0))) (.cse35 (<= 2 ~m_st~0)) (.cse4 (<= 2 ~t2_st~0)) (.cse36 (not .cse8)) (.cse37 (not (= 1 ~T2_E~0))) (.cse5 (not (= ~E_2~0 0)))) (let ((.cse3 (= ~m_st~0 0)) (.cse7 (= |old(~token~0)| ~token~0)) (.cse17 (not (= 0 |old(~m_st~0)|))) (.cse9 (not (<= 2 |old(~t2_st~0)|))) (.cse11 (not (<= |old(~token~0)| ~local~0))) (.cse32 (not (= |old(~t1_pc~0)| 1))) (.cse12 (not (<= ~local~0 |old(~token~0)|))) (.cse29 (and .cse0 (let ((.cse38 (and .cse2 .cse35 .cse4 .cse36 .cse37 .cse5))) (or (and .cse6 .cse38) (and .cse1 .cse38))))) (.cse16 (not .cse34)) (.cse10 (= ~T2_E~0 1)) (.cse33 (and .cse0 (or (and .cse6 .cse2 .cse35 .cse36 .cse37 .cse5) (and .cse1 .cse2 .cse35 .cse36 .cse37 .cse5)))) (.cse30 (not (<= 2 |old(~m_st~0)|))) (.cse13 (= ~T2_E~0 0)) (.cse14 (= 1 ~M_E~0)) (.cse15 (= 1 ~E_M~0)) (.cse18 (not (= ~m_i~0 1))) (.cse19 (= 1 ~E_1~0)) (.cse20 (= 1 |old(~E_2~0)|)) (.cse31 (not .cse28)) (.cse21 (= 0 ~E_1~0)) (.cse22 (not (= 1 ~t1_i~0))) (.cse23 (not (= 1 ~t2_i~0))) (.cse24 (= 0 ~E_M~0)) (.cse25 (= 0 |old(~E_2~0)|)) (.cse26 (= |old(~t1_st~0)| 0)) (.cse27 (not (<= |old(~t1_pc~0)| 0)))) (and (or (and .cse0 (or (and .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse2 .cse3 .cse4 .cse5)) .cse7) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28) (or .cse8 .cse9 .cse10 .cse29 .cse30 .cse13 .cse14 .cse15 .cse16 .cse18 .cse19 .cse20 .cse31 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27) (or .cse8 .cse10 .cse32 .cse33 .cse30 .cse13 .cse14 .cse15 .cse18 .cse34 .cse19 .cse20 .cse31 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26) (or .cse8 .cse10 .cse11 .cse12 (and .cse0 (or (and .cse6 .cse2 .cse3 .cse5) (and .cse1 .cse2 .cse3 .cse5)) .cse7) .cse13 .cse14 .cse15 .cse17 .cse18 .cse34 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28) (or .cse8 .cse9 .cse10 .cse11 (and .cse6 .cse2 .cse35 (<= ~token~0 (+ |old(~token~0)| 1)) .cse5 .cse0 (<= (+ ~local~0 1) ~token~0)) .cse32 .cse12 .cse29 .cse30 .cse13 .cse14 .cse15 .cse16 .cse18 .cse19 .cse20 .cse31 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26) (or .cse8 .cse10 .cse33 .cse30 .cse13 .cse14 .cse15 .cse18 .cse34 .cse19 .cse20 .cse31 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27))))) [2019-10-02 16:21:02,587 INFO L443 ceAbstractionStarter]: For program point L87(lines 87 91) no Hoare annotation was computed. [2019-10-02 16:21:02,588 INFO L439 ceAbstractionStarter]: At program point transmit1ENTRY(lines 80 115) the Hoare annotation is: (let ((.cse32 (= 1 ~t2_pc~0)) (.cse33 (= 1 ~m_pc~0))) (let ((.cse17 (= 1 ~t1_pc~0)) (.cse4 (not (= |old(~t1_pc~0)| 1))) (.cse6 (not (<= 2 |old(~m_st~0)|))) (.cse18 (<= 2 ~m_st~0)) (.cse14 (not .cse33)) (.cse0 (= ~T1_E~0 0)) (.cse1 (not (<= 2 |old(~t2_st~0)|))) (.cse2 (= ~T2_E~0 1)) (.cse3 (not (<= |old(~token~0)| ~local~0))) (.cse5 (not (<= ~local~0 |old(~token~0)|))) (.cse7 (= ~T2_E~0 0)) (.cse28 (<= ~t1_pc~0 0)) (.cse30 (= ~m_st~0 0)) (.cse19 (<= ~token~0 ~local~0)) (.cse20 (= ~E_2~0 |old(~E_2~0)|)) (.cse21 (<= 2 ~t2_st~0)) (.cse22 (= |old(~t1_st~0)| ~t1_st~0)) (.cse23 (<= ~local~0 ~token~0)) (.cse8 (= 1 ~M_E~0)) (.cse9 (= 1 ~E_M~0)) (.cse10 (not .cse32)) (.cse31 (not (= 0 |old(~m_st~0)|))) (.cse11 (not (= ~m_i~0 1))) (.cse12 (= 1 ~E_1~0)) (.cse13 (= 1 |old(~E_2~0)|)) (.cse15 (= 0 ~E_1~0)) (.cse16 (not (= 1 ~t1_i~0))) (.cse24 (not (= 1 ~t2_i~0))) (.cse25 (= 0 ~E_M~0)) (.cse26 (= 0 |old(~E_2~0)|)) (.cse27 (= |old(~t1_st~0)| 0)) (.cse29 (not (<= |old(~t1_pc~0)| 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (and .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) .cse24 .cse25 .cse26 .cse27) (or .cse0 .cse1 .cse2 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse24 .cse25 .cse26 .cse27 (and .cse28 .cse18 .cse20 .cse21 .cse22) .cse29) (or .cse0 .cse2 .cse3 .cse5 .cse7 .cse8 .cse9 (and .cse28 .cse30 .cse19 .cse20 .cse22 .cse23) .cse31 .cse11 .cse32 .cse12 .cse13 .cse15 .cse16 .cse24 .cse25 .cse26 .cse27 .cse29 .cse33) (or (and .cse17 .cse18 .cse20 .cse22) .cse0 .cse2 .cse4 .cse6 .cse7 .cse8 .cse9 .cse11 .cse32 .cse12 .cse13 .cse14 .cse15 .cse16 .cse24 .cse25 .cse26 .cse27) (or .cse0 .cse2 .cse6 .cse7 .cse8 .cse9 (and .cse28 .cse18 .cse20 .cse22) .cse11 .cse32 .cse12 .cse13 .cse14 .cse15 .cse16 .cse24 .cse25 .cse26 .cse27 .cse29) (or .cse0 .cse1 .cse2 .cse3 .cse5 .cse7 (and .cse28 .cse30 .cse19 .cse20 .cse21 .cse22 .cse23) .cse8 .cse9 .cse10 .cse31 .cse11 .cse12 .cse13 .cse15 .cse16 .cse24 .cse25 .cse26 .cse27 .cse29 .cse33)))) [2019-10-02 16:21:02,588 INFO L443 ceAbstractionStarter]: For program point L96(line 96) no Hoare annotation was computed. [2019-10-02 16:21:02,588 INFO L439 ceAbstractionStarter]: At program point L88(lines 83 114) the Hoare annotation is: (let ((.cse19 (= 1 ~m_pc~0))) (let ((.cse20 (not (<= 2 |old(~t2_st~0)|))) (.cse2 (not (<= |old(~token~0)| ~local~0))) (.cse3 (not (<= ~local~0 |old(~token~0)|))) (.cse7 (not (= 0 |old(~m_st~0)|))) (.cse24 (= 1 ~t1_pc~0)) (.cse25 (<= 2 ~m_st~0)) (.cse26 (= ~E_2~0 |old(~E_2~0)|)) (.cse27 (= |old(~t1_st~0)| ~t1_st~0)) (.cse21 (not (= |old(~t1_pc~0)| 1))) (.cse0 (= ~T1_E~0 0)) (.cse1 (= ~T2_E~0 1)) (.cse22 (not (<= 2 |old(~m_st~0)|))) (.cse4 (= ~T2_E~0 0)) (.cse5 (= 1 ~M_E~0)) (.cse6 (= 1 ~E_M~0)) (.cse8 (not (= ~m_i~0 1))) (.cse9 (= 1 ~t2_pc~0)) (.cse10 (= 1 ~E_1~0)) (.cse11 (= 1 |old(~E_2~0)|)) (.cse23 (not .cse19)) (.cse12 (= 0 ~E_1~0)) (.cse13 (not (= 1 ~t1_i~0))) (.cse14 (not (= 1 ~t2_i~0))) (.cse15 (= 0 ~E_M~0)) (.cse16 (= 0 |old(~E_2~0)|)) (.cse17 (= |old(~t1_st~0)| 0)) (.cse18 (not (<= |old(~t1_pc~0)| 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (or .cse0 .cse20 .cse1 .cse2 .cse21 .cse3 .cse22 .cse4 .cse5 .cse6 (not .cse9) .cse8 .cse10 .cse11 .cse23 .cse12 .cse13 (and .cse24 .cse25 (<= ~token~0 ~local~0) .cse26 (<= 2 ~t2_st~0) .cse27 (<= ~local~0 ~token~0)) .cse14 .cse15 .cse16 .cse17) (or .cse0 .cse20 .cse1 .cse22 .cse4 .cse5 .cse6 .cse8 .cse10 .cse11 .cse23 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (or .cse0 .cse20 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (or (and .cse24 .cse25 .cse26 .cse27) .cse0 .cse1 .cse21 .cse22 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse23 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (or .cse0 .cse1 .cse22 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse23 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18)))) [2019-10-02 16:21:02,589 INFO L443 ceAbstractionStarter]: For program point transmit1EXIT(lines 80 115) no Hoare annotation was computed. [2019-10-02 16:21:02,589 INFO L439 ceAbstractionStarter]: At program point L109(lines 80 115) the Hoare annotation is: (let ((.cse0 (= ~T1_E~0 0)) (.cse4 (= ~T2_E~0 0))) (let ((.cse33 (= 1 ~m_pc~0)) (.cse9 (= 1 ~t2_pc~0)) (.cse26 (<= 2 ~t2_st~0)) (.cse20 (= 1 ~t1_pc~0)) (.cse36 (not .cse4)) (.cse21 (not (= 1 ~E_2~0))) (.cse34 (<= 2 ~m_st~0)) (.cse23 (<= 2 ~t1_st~0)) (.cse37 (not .cse0)) (.cse38 (not (= 1 ~T2_E~0))) (.cse25 (not (= ~E_2~0 0)))) (let ((.cse22 (= ~m_st~0 0)) (.cse24 (<= ~token~0 ~local~0)) (.cse27 (<= ~local~0 ~token~0)) (.cse31 (not (= 0 |old(~m_st~0)|))) (.cse28 (not (<= |old(~token~0)| ~local~0))) (.cse2 (not (= |old(~t1_pc~0)| 1))) (.cse29 (not (<= ~local~0 |old(~token~0)|))) (.cse5 (and .cse20 .cse36 .cse21 .cse34 .cse23 .cse37 .cse38 .cse25)) (.cse19 (not (<= 2 |old(~t2_st~0)|))) (.cse1 (= ~T2_E~0 1)) (.cse3 (not (<= 2 |old(~m_st~0)|))) (.cse35 (and .cse20 .cse36 .cse21 .cse34 .cse23 .cse26 .cse37 .cse38 .cse25)) (.cse6 (= 1 ~M_E~0)) (.cse7 (= 1 ~E_M~0)) (.cse30 (not .cse9)) (.cse8 (not (= ~m_i~0 1))) (.cse10 (= 1 ~E_1~0)) (.cse11 (= 1 |old(~E_2~0)|)) (.cse12 (not .cse33)) (.cse13 (= 0 ~E_1~0)) (.cse14 (not (= 1 ~t1_i~0))) (.cse15 (not (= 1 ~t2_i~0))) (.cse16 (= 0 ~E_M~0)) (.cse17 (= 0 |old(~E_2~0)|)) (.cse18 (= |old(~t1_st~0)| 0)) (.cse32 (not (<= |old(~t1_pc~0)| 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (or .cse0 .cse19 (and .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27) .cse1 .cse28 .cse29 .cse4 .cse6 .cse7 .cse30 .cse31 .cse8 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse32 .cse33) (or .cse0 .cse1 .cse28 .cse29 (and .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse27) .cse4 .cse6 .cse7 .cse31 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse32 .cse33) (or .cse0 .cse19 (and .cse20 .cse21 .cse34 .cse23 (<= ~token~0 (+ |old(~token~0)| 1)) .cse25 (<= (+ ~local~0 1) ~token~0)) .cse1 .cse28 .cse2 .cse29 .cse3 .cse4 .cse35 .cse6 .cse7 .cse30 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (or .cse0 .cse1 .cse3 .cse5 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse32) (or .cse0 .cse19 .cse1 .cse3 .cse35 .cse4 .cse6 .cse7 .cse30 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse32))))) [2019-10-02 16:21:02,590 INFO L439 ceAbstractionStarter]: At program point L105(line 105) the Hoare annotation is: (let ((.cse19 (= 1 ~m_pc~0))) (let ((.cse7 (not (= 0 |old(~m_st~0)|))) (.cse20 (not (<= 2 |old(~t2_st~0)|))) (.cse2 (not (<= |old(~token~0)| ~local~0))) (.cse23 (not (= |old(~t1_pc~0)| 1))) (.cse3 (not (<= ~local~0 |old(~token~0)|))) (.cse24 (= 1 ~t1_pc~0)) (.cse25 (<= 2 ~m_st~0)) (.cse27 (not (= ~E_2~0 0))) (.cse26 (= |old(~t1_st~0)| ~t1_st~0)) (.cse0 (= ~T1_E~0 0)) (.cse1 (= ~T2_E~0 1)) (.cse21 (not (<= 2 |old(~m_st~0)|))) (.cse4 (= ~T2_E~0 0)) (.cse5 (= 1 ~M_E~0)) (.cse6 (= 1 ~E_M~0)) (.cse8 (not (= ~m_i~0 1))) (.cse9 (= 1 ~t2_pc~0)) (.cse10 (= 1 ~E_1~0)) (.cse11 (= 1 |old(~E_2~0)|)) (.cse22 (not .cse19)) (.cse12 (= 0 ~E_1~0)) (.cse13 (not (= 1 ~t1_i~0))) (.cse14 (not (= 1 ~t2_i~0))) (.cse15 (= 0 ~E_M~0)) (.cse16 (= 0 |old(~E_2~0)|)) (.cse17 (= |old(~t1_st~0)| 0)) (.cse18 (not (<= |old(~t1_pc~0)| 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (or .cse0 .cse20 .cse1 .cse21 .cse4 .cse5 .cse6 .cse8 .cse10 .cse11 .cse22 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (or .cse0 .cse1 .cse23 .cse21 .cse4 .cse5 (and .cse24 .cse25 .cse26 .cse27) .cse6 .cse8 .cse9 .cse10 .cse11 .cse22 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (or .cse0 .cse20 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (or .cse0 .cse20 .cse1 .cse2 .cse23 .cse3 .cse21 .cse4 .cse5 .cse6 (not .cse9) .cse8 .cse10 .cse11 .cse22 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (and .cse24 .cse25 (<= ~token~0 (+ |old(~token~0)| 1)) .cse27 (<= 2 ~t2_st~0) .cse26 (<= (+ ~local~0 1) ~token~0))) (or .cse0 .cse1 .cse21 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse22 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18)))) [2019-10-02 16:21:02,590 INFO L443 ceAbstractionStarter]: For program point L105-1(line 105) no Hoare annotation was computed. [2019-10-02 16:21:02,590 INFO L443 ceAbstractionStarter]: For program point immediate_notifyEXIT(lines 440 450) no Hoare annotation was computed. [2019-10-02 16:21:02,590 INFO L439 ceAbstractionStarter]: At program point immediate_notifyENTRY(lines 440 450) the Hoare annotation is: (let ((.cse25 (<= 2 ~t2_st~0)) (.cse28 (= 1 ~E_1~0)) (.cse8 (= 1 ~t2_pc~0)) (.cse16 (= 1 ~m_pc~0)) (.cse24 (<= 2 ~m_st~0)) (.cse9 (= |old(~t1_st~0)| ~t1_st~0)) (.cse31 (= |old(~t1_st~0)| 0))) (let ((.cse4 (not .cse31)) (.cse15 (not (<= ~t1_pc~0 0))) (.cse32 (and .cse24 .cse9)) (.cse26 (not (<= 2 |old(~m_st~0)|))) (.cse29 (not .cse16)) (.cse30 (= 0 ~E_1~0)) (.cse0 (= ~T1_E~0 0)) (.cse17 (not (<= 2 |old(~t2_st~0)|))) (.cse1 (= ~T2_E~0 1)) (.cse20 (not (<= ~token~0 ~local~0))) (.cse21 (not (= ~t1_pc~0 1))) (.cse22 (not (<= ~local~0 ~token~0))) (.cse2 (= ~T2_E~0 0)) (.cse3 (= 1 ~M_E~0)) (.cse5 (= 1 ~E_M~0)) (.cse19 (not .cse8)) (.cse23 (not (<= 2 |old(~t1_st~0)|))) (.cse6 (not .cse28)) (.cse7 (not (= ~m_i~0 1))) (.cse10 (= 1 ~E_2~0)) (.cse11 (not (= 1 ~t1_i~0))) (.cse12 (not (= 1 ~t2_i~0))) (.cse13 (= 0 ~E_M~0)) (.cse14 (= 0 ~E_2~0)) (.cse18 (and .cse25 .cse9))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse0 .cse17 .cse1 .cse18 .cse2 .cse3 .cse4 .cse5 .cse19 .cse6 .cse7 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse0 .cse1 .cse20 .cse21 .cse22 .cse2 .cse3 .cse5 .cse23 .cse6 .cse7 .cse8 .cse10 .cse9 .cse11 .cse12 .cse13 .cse14 .cse16) (let ((.cse27 (+ ~local~0 1))) (or .cse0 .cse17 .cse1 .cse21 (and .cse24 .cse25 .cse9) .cse26 .cse2 .cse3 .cse5 .cse19 (not (<= .cse27 ~token~0)) .cse7 .cse28 .cse29 .cse30 .cse11 .cse12 (not (<= ~token~0 .cse27)) .cse13 .cse14 .cse31)) (or .cse0 .cse1 .cse21 .cse26 .cse2 .cse32 .cse3 .cse5 .cse7 .cse8 .cse28 .cse29 .cse30 .cse11 .cse12 .cse13 .cse14 .cse31) (let ((.cse33 (+ ~local~0 2))) (or .cse0 .cse32 .cse1 (not (<= ~token~0 .cse33)) .cse21 .cse26 .cse2 .cse3 .cse19 .cse23 .cse7 .cse28 .cse10 .cse29 .cse30 .cse11 .cse12 .cse13 .cse14 (not (<= .cse33 ~token~0)))) (or .cse0 .cse17 .cse1 .cse20 .cse21 .cse22 .cse2 .cse3 .cse5 .cse19 .cse23 .cse6 .cse7 .cse10 .cse11 .cse12 .cse13 .cse14 .cse18)))) [2019-10-02 16:21:02,590 INFO L443 ceAbstractionStarter]: For program point immediate_notifyFINAL(lines 440 450) no Hoare annotation was computed. [2019-10-02 16:21:02,591 INFO L443 ceAbstractionStarter]: For program point L415(lines 415 419) no Hoare annotation was computed. [2019-10-02 16:21:02,591 INFO L439 ceAbstractionStarter]: At program point L413(line 413) the Hoare annotation is: (let ((.cse19 (= 1 ~E_1~0)) (.cse8 (= 1 ~t2_pc~0)) (.cse16 (= 1 ~m_pc~0)) (.cse35 (<= 2 ~m_st~0)) (.cse34 (<= 2 ~t2_st~0)) (.cse9 (= |old(~t1_st~0)| ~t1_st~0)) (.cse36 (+ ~local~0 1)) (.cse30 (= |old(~t1_st~0)| 0))) (let ((.cse4 (not .cse30)) (.cse15 (not (<= ~t1_pc~0 0))) (.cse27 (not (<= .cse36 ~token~0))) (.cse29 (not (<= ~token~0 .cse36))) (.cse25 (and .cse35 .cse34 .cse9)) (.cse26 (not (<= 2 |old(~m_st~0)|))) (.cse28 (not .cse16)) (.cse20 (= 0 ~E_1~0)) (.cse31 (and .cse35 .cse9)) (.cse0 (= ~T1_E~0 0)) (.cse21 (not (<= 2 |old(~t2_st~0)|))) (.cse1 (= ~T2_E~0 1)) (.cse17 (not (<= ~token~0 ~local~0))) (.cse24 (not (= ~t1_pc~0 1))) (.cse18 (not (<= ~local~0 ~token~0))) (.cse2 (= ~T2_E~0 0)) (.cse3 (= 1 ~M_E~0)) (.cse5 (= 1 ~E_M~0)) (.cse23 (not .cse8)) (.cse32 (not (<= 2 |old(~t1_st~0)|))) (.cse6 (not .cse19)) (.cse7 (not (= ~m_i~0 1))) (.cse10 (= 1 ~E_2~0)) (.cse11 (not (= 1 ~t1_i~0))) (.cse12 (not (= 1 ~t2_i~0))) (.cse13 (= 0 ~E_M~0)) (.cse14 (= 0 ~E_2~0)) (.cse22 (and .cse34 .cse9))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse0 .cse1 .cse17 .cse18 (and (= ~m_st~0 0) .cse9) .cse2 .cse4 .cse5 (not (= 0 |old(~m_st~0)|)) .cse7 .cse8 .cse19 .cse10 .cse20 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse0 .cse21 .cse1 .cse22 .cse2 .cse3 .cse4 .cse5 .cse23 .cse6 .cse7 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse0 .cse21 .cse1 .cse24 .cse25 .cse26 .cse2 .cse3 .cse5 .cse23 .cse27 .cse7 .cse19 .cse28 .cse20 .cse11 .cse12 .cse29 .cse13 .cse14 .cse30) (or .cse0 .cse1 .cse24 .cse26 .cse2 .cse31 .cse5 .cse32 .cse27 .cse7 .cse19 .cse10 .cse28 .cse20 .cse11 .cse12 .cse29 .cse13 .cse14) (or .cse0 .cse1 .cse17 .cse24 .cse18 .cse2 .cse3 .cse5 .cse32 .cse6 .cse7 .cse8 .cse10 .cse9 .cse11 .cse12 .cse13 .cse14 .cse16) (or .cse0 .cse1 .cse24 .cse26 .cse2 .cse31 .cse3 .cse5 .cse7 .cse8 .cse19 .cse28 .cse20 .cse11 .cse12 .cse13 .cse14 .cse30) (let ((.cse33 (+ ~local~0 2))) (or .cse0 .cse31 .cse1 (not (<= ~token~0 .cse33)) .cse24 .cse26 .cse2 .cse3 .cse23 .cse32 .cse7 .cse19 .cse10 .cse28 .cse20 .cse11 .cse12 .cse13 .cse14 (not (<= .cse33 ~token~0)))) (or .cse0 .cse21 .cse1 .cse24 .cse26 .cse2 .cse5 .cse23 .cse32 .cse7 .cse19 .cse10 .cse28 .cse20 .cse25 .cse11 .cse12 .cse13 .cse14) (or .cse0 .cse1 .cse24 .cse26 .cse2 .cse5 .cse32 .cse7 .cse8 .cse19 .cse10 .cse28 .cse20 .cse11 .cse12 .cse13 .cse14 .cse31) (or .cse0 .cse21 .cse1 .cse17 .cse24 .cse18 .cse2 .cse3 .cse5 .cse23 .cse32 .cse6 .cse7 .cse10 .cse11 .cse12 .cse13 .cse14 .cse22)))) [2019-10-02 16:21:02,592 INFO L439 ceAbstractionStarter]: At program point L415-2(lines 415 419) the Hoare annotation is: (let ((.cse27 (= 1 ~m_pc~0)) (.cse28 (= 1 ~t2_pc~0)) (.cse37 (<= 2 ~m_st~0)) (.cse39 (+ ~local~0 1)) (.cse36 (= |old(~t1_st~0)| 0)) (.cse13 (= 1 ~E_1~0)) (.cse38 (<= 2 ~t2_st~0)) (.cse34 (= 0 activate_threads_~tmp~1)) (.cse4 (= |old(~t1_st~0)| ~t1_st~0))) (let ((.cse29 (and .cse34 .cse4)) (.cse22 (and .cse34 .cse38 .cse4)) (.cse25 (not .cse13)) (.cse30 (not (<= ~token~0 ~local~0))) (.cse31 (not (<= ~local~0 ~token~0))) (.cse24 (not .cse36)) (.cse2 (= ~m_st~0 0)) (.cse26 (not (<= ~t1_pc~0 0))) (.cse32 (not (<= .cse39 ~token~0))) (.cse33 (not (<= ~token~0 .cse39))) (.cse16 (and .cse37 .cse34 .cse4)) (.cse9 (= 1 ~M_E~0)) (.cse0 (= ~T1_E~0 0)) (.cse23 (not (<= 2 |old(~t2_st~0)|))) (.cse1 (= ~T2_E~0 1)) (.cse6 (not (= ~t1_pc~0 1))) (.cse7 (not (<= 2 |old(~m_st~0)|))) (.cse8 (= ~T2_E~0 0)) (.cse3 (= 1 ~E_M~0)) (.cse10 (not .cse28)) (.cse11 (not (<= 2 |old(~t1_st~0)|))) (.cse12 (not (= ~m_i~0 1))) (.cse14 (= 1 ~E_2~0)) (.cse15 (not .cse27)) (.cse17 (= 0 ~E_1~0)) (.cse35 (and .cse37 .cse34 .cse38 .cse4)) (.cse18 (not (= 1 ~t1_i~0))) (.cse19 (not (= 1 ~t2_i~0))) (.cse20 (= 0 ~E_M~0)) (.cse21 (= 0 ~E_2~0))) (and (let ((.cse5 (+ ~local~0 2))) (or .cse0 .cse1 (and .cse2 .cse3 .cse4) (not (<= ~token~0 .cse5)) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 (not (<= .cse5 ~token~0)))) (or .cse0 .cse22 .cse23 .cse1 .cse8 .cse9 .cse24 .cse3 .cse10 .cse25 .cse12 .cse14 .cse18 .cse19 .cse20 .cse21 .cse26 .cse27) (or .cse0 .cse1 .cse6 .cse16 .cse7 .cse8 .cse3 .cse11 .cse12 .cse28 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19 .cse20 .cse21) (or .cse0 .cse1 .cse29 .cse8 .cse9 .cse24 .cse3 .cse25 .cse12 .cse28 .cse14 .cse18 .cse19 .cse20 .cse21 .cse26 .cse27) (or .cse0 .cse1 .cse30 .cse6 .cse31 .cse8 .cse29 .cse9 .cse3 .cse11 .cse25 .cse12 .cse28 .cse14 .cse18 .cse19 .cse20 .cse21 .cse27) (or .cse0 .cse23 .cse22 .cse1 .cse30 .cse6 .cse31 .cse8 .cse9 .cse3 .cse10 .cse11 .cse25 .cse12 .cse14 .cse18 .cse19 .cse20 .cse21) (or .cse0 .cse1 .cse6 .cse7 .cse8 .cse16 .cse3 .cse11 .cse32 .cse12 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19 .cse33 .cse20 .cse21) (or .cse0 .cse1 .cse30 .cse31 .cse8 .cse24 .cse3 (not (= 0 |old(~m_st~0)|)) .cse12 .cse28 .cse13 .cse14 .cse17 .cse18 .cse19 .cse20 .cse21 (and .cse2 .cse34 .cse4) .cse26 .cse27) (or .cse0 .cse23 .cse1 .cse6 .cse7 .cse8 .cse9 .cse35 .cse3 .cse10 .cse32 .cse12 .cse13 .cse15 .cse17 .cse18 .cse19 .cse33 .cse20 .cse21 .cse36) (or .cse16 .cse0 .cse1 .cse6 .cse7 .cse8 .cse9 .cse3 .cse12 .cse28 .cse13 .cse15 .cse17 .cse18 .cse19 .cse20 .cse21 .cse36) (or .cse0 .cse23 .cse1 .cse6 .cse7 .cse8 .cse3 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17 .cse35 .cse18 .cse19 .cse20 .cse21)))) [2019-10-02 16:21:02,592 INFO L443 ceAbstractionStarter]: For program point L413-1(line 413) no Hoare annotation was computed. [2019-10-02 16:21:02,592 INFO L443 ceAbstractionStarter]: For program point L431(lines 431 435) no Hoare annotation was computed. [2019-10-02 16:21:02,592 INFO L439 ceAbstractionStarter]: At program point activate_threadsENTRY(lines 406 439) the Hoare annotation is: (let ((.cse19 (= 1 ~E_1~0)) (.cse8 (= 1 ~t2_pc~0)) (.cse16 (= 1 ~m_pc~0)) (.cse35 (<= 2 ~m_st~0)) (.cse34 (<= 2 ~t2_st~0)) (.cse9 (= |old(~t1_st~0)| ~t1_st~0)) (.cse36 (+ ~local~0 1)) (.cse30 (= |old(~t1_st~0)| 0))) (let ((.cse4 (not .cse30)) (.cse15 (not (<= ~t1_pc~0 0))) (.cse27 (not (<= .cse36 ~token~0))) (.cse29 (not (<= ~token~0 .cse36))) (.cse25 (and .cse35 .cse34 .cse9)) (.cse26 (not (<= 2 |old(~m_st~0)|))) (.cse28 (not .cse16)) (.cse20 (= 0 ~E_1~0)) (.cse31 (and .cse35 .cse9)) (.cse0 (= ~T1_E~0 0)) (.cse21 (not (<= 2 |old(~t2_st~0)|))) (.cse1 (= ~T2_E~0 1)) (.cse17 (not (<= ~token~0 ~local~0))) (.cse24 (not (= ~t1_pc~0 1))) (.cse18 (not (<= ~local~0 ~token~0))) (.cse2 (= ~T2_E~0 0)) (.cse3 (= 1 ~M_E~0)) (.cse5 (= 1 ~E_M~0)) (.cse23 (not .cse8)) (.cse32 (not (<= 2 |old(~t1_st~0)|))) (.cse6 (not .cse19)) (.cse7 (not (= ~m_i~0 1))) (.cse10 (= 1 ~E_2~0)) (.cse11 (not (= 1 ~t1_i~0))) (.cse12 (not (= 1 ~t2_i~0))) (.cse13 (= 0 ~E_M~0)) (.cse14 (= 0 ~E_2~0)) (.cse22 (and .cse34 .cse9))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse0 .cse1 .cse17 .cse18 (and (= ~m_st~0 0) .cse9) .cse2 .cse4 .cse5 (not (= 0 |old(~m_st~0)|)) .cse7 .cse8 .cse19 .cse10 .cse20 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse0 .cse21 .cse1 .cse22 .cse2 .cse3 .cse4 .cse5 .cse23 .cse6 .cse7 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse0 .cse21 .cse1 .cse24 .cse25 .cse26 .cse2 .cse3 .cse5 .cse23 .cse27 .cse7 .cse19 .cse28 .cse20 .cse11 .cse12 .cse29 .cse13 .cse14 .cse30) (or .cse0 .cse1 .cse24 .cse26 .cse2 .cse31 .cse5 .cse32 .cse27 .cse7 .cse19 .cse10 .cse28 .cse20 .cse11 .cse12 .cse29 .cse13 .cse14) (or .cse0 .cse1 .cse17 .cse24 .cse18 .cse2 .cse3 .cse5 .cse32 .cse6 .cse7 .cse8 .cse10 .cse9 .cse11 .cse12 .cse13 .cse14 .cse16) (or .cse0 .cse1 .cse24 .cse26 .cse2 .cse31 .cse3 .cse5 .cse7 .cse8 .cse19 .cse28 .cse20 .cse11 .cse12 .cse13 .cse14 .cse30) (let ((.cse33 (+ ~local~0 2))) (or .cse0 .cse31 .cse1 (not (<= ~token~0 .cse33)) .cse24 .cse26 .cse2 .cse3 .cse23 .cse32 .cse7 .cse19 .cse10 .cse28 .cse20 .cse11 .cse12 .cse13 .cse14 (not (<= .cse33 ~token~0)))) (or .cse0 .cse21 .cse1 .cse24 .cse26 .cse2 .cse5 .cse23 .cse32 .cse7 .cse19 .cse10 .cse28 .cse20 .cse25 .cse11 .cse12 .cse13 .cse14) (or .cse0 .cse1 .cse24 .cse26 .cse2 .cse5 .cse32 .cse7 .cse8 .cse19 .cse10 .cse28 .cse20 .cse11 .cse12 .cse13 .cse14 .cse31) (or .cse0 .cse21 .cse1 .cse17 .cse24 .cse18 .cse2 .cse3 .cse5 .cse23 .cse32 .cse6 .cse7 .cse10 .cse11 .cse12 .cse13 .cse14 .cse22)))) [2019-10-02 16:21:02,592 INFO L443 ceAbstractionStarter]: For program point L429(line 429) no Hoare annotation was computed. [2019-10-02 16:21:02,593 INFO L443 ceAbstractionStarter]: For program point L431-2(lines 406 439) no Hoare annotation was computed. [2019-10-02 16:21:02,593 INFO L443 ceAbstractionStarter]: For program point activate_threadsEXIT(lines 406 439) no Hoare annotation was computed. [2019-10-02 16:21:02,593 INFO L443 ceAbstractionStarter]: For program point L423(lines 423 427) no Hoare annotation was computed. [2019-10-02 16:21:02,593 INFO L443 ceAbstractionStarter]: For program point L421(line 421) no Hoare annotation was computed. [2019-10-02 16:21:02,593 INFO L439 ceAbstractionStarter]: At program point L423-2(lines 423 427) the Hoare annotation is: (let ((.cse13 (= 1 ~E_1~0)) (.cse21 (= 1 ~m_pc~0)) (.cse39 (+ ~local~0 1)) (.cse12 (= 1 ~t2_pc~0)) (.cse38 (<= 2 ~t2_st~0)) (.cse40 (<= 2 ~m_st~0)) (.cse7 (= activate_threads_~tmp___0~0 0)) (.cse8 (= 0 activate_threads_~tmp~1)) (.cse9 (= |old(~t1_st~0)| ~t1_st~0)) (.cse36 (= |old(~t1_st~0)| 0))) (let ((.cse6 (= ~m_st~0 0)) (.cse5 (not .cse36)) (.cse20 (not (<= ~t1_pc~0 0))) (.cse28 (and .cse40 .cse7 .cse8 .cse9)) (.cse31 (and .cse7 .cse8 .cse38 .cse9)) (.cse33 (and .cse40 .cse7 .cse8 .cse38 .cse9)) (.cse30 (not (<= 2 |old(~t2_st~0)|))) (.cse24 (not (<= 2 |old(~m_st~0)|))) (.cse26 (not .cse12)) (.cse34 (not (<= .cse39 ~token~0))) (.cse29 (not .cse21)) (.cse15 (= 0 ~E_1~0)) (.cse35 (not (<= ~token~0 .cse39))) (.cse37 (= 0 ~t1_st~0)) (.cse0 (= ~T1_E~0 0)) (.cse1 (= ~T2_E~0 1)) (.cse2 (not (<= ~token~0 ~local~0))) (.cse23 (not (= ~t1_pc~0 1))) (.cse3 (not (<= ~local~0 ~token~0))) (.cse4 (= ~T2_E~0 0)) (.cse25 (= 1 ~M_E~0)) (.cse10 (= 1 ~E_M~0)) (.cse27 (not (<= 2 |old(~t1_st~0)|))) (.cse32 (not .cse13)) (.cse11 (not (= ~m_i~0 1))) (.cse14 (= 1 ~E_2~0)) (.cse16 (not (= 1 ~t1_i~0))) (.cse17 (not (= 1 ~t2_i~0))) (.cse18 (= 0 ~E_M~0)) (.cse19 (= 0 ~E_2~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (and .cse6 .cse7 .cse8 .cse9) .cse10 (not (= 0 |old(~m_st~0)|)) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (let ((.cse22 (+ ~local~0 2))) (or .cse0 .cse1 (not (<= ~token~0 .cse22)) .cse23 .cse24 .cse4 .cse25 .cse26 .cse27 .cse11 .cse13 .cse28 .cse14 .cse29 .cse15 (and .cse6 .cse7 .cse10 .cse9) .cse16 .cse17 .cse18 .cse19 (not (<= .cse22 ~token~0)))) (or .cse0 .cse1 .cse23 .cse28 .cse24 .cse4 .cse10 .cse27 .cse11 .cse12 .cse13 .cse14 .cse29 .cse15 .cse16 .cse17 .cse18 .cse19) (or .cse0 .cse30 .cse1 .cse4 .cse31 .cse25 .cse5 .cse10 .cse26 .cse32 .cse11 .cse14 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (or .cse0 .cse30 .cse1 .cse23 .cse24 .cse4 .cse10 .cse26 .cse27 .cse11 .cse13 .cse33 .cse14 .cse29 .cse15 .cse16 .cse17 .cse18 .cse19) (or .cse0 .cse1 .cse23 .cse24 .cse4 .cse28 .cse10 .cse27 .cse34 .cse11 .cse13 .cse14 .cse29 .cse15 .cse16 .cse17 .cse35 .cse18 .cse19) (or .cse0 .cse1 .cse4 .cse25 .cse5 .cse10 .cse32 .cse11 .cse12 .cse14 .cse16 (and .cse7 .cse8 .cse9) .cse17 .cse18 .cse19 .cse20 .cse21) (or .cse28 .cse0 .cse1 .cse23 .cse24 .cse4 .cse25 .cse10 .cse11 .cse12 .cse13 .cse29 .cse15 .cse16 .cse17 .cse18 .cse19 .cse36) (or .cse0 .cse30 .cse1 .cse2 .cse23 .cse3 .cse4 .cse25 (and .cse8 .cse37 .cse38) .cse10 .cse26 .cse27 .cse32 .cse11 .cse14 .cse16 .cse17 .cse18 .cse19 .cse31) (or .cse33 .cse0 .cse30 .cse1 .cse23 .cse24 .cse4 .cse25 .cse10 .cse26 .cse34 .cse11 .cse13 .cse29 .cse15 .cse16 .cse17 .cse35 .cse18 .cse19 .cse36) (or (and .cse8 .cse37) .cse0 .cse1 .cse2 .cse23 .cse3 .cse4 .cse25 .cse10 .cse27 .cse32 .cse11 .cse12 .cse14 (and .cse7 .cse9 .cse8) .cse16 .cse17 .cse18 .cse19 .cse21)))) [2019-10-02 16:21:02,594 INFO L439 ceAbstractionStarter]: At program point L124(lines 119 150) the Hoare annotation is: (let ((.cse22 (= 1 ~m_pc~0))) (let ((.cse2 (not (<= |old(~token~0)| ~local~0))) (.cse4 (not (<= ~local~0 |old(~token~0)|))) (.cse20 (not (= 0 |old(~m_st~0)|))) (.cse3 (not (= ~t1_pc~0 1))) (.cse23 (not (<= 2 |old(~t1_st~0)|))) (.cse0 (= ~T1_E~0 0)) (.cse1 (= ~T2_E~0 1)) (.cse5 (not (<= 2 |old(~m_st~0)|))) (.cse6 (= ~T2_E~0 0)) (.cse7 (= 1 ~M_E~0)) (.cse8 (not (= |old(~t1_st~0)| 0))) (.cse9 (= 1 |old(~E_M~0)|)) (.cse10 (not (= ~m_i~0 1))) (.cse11 (= 1 |old(~t2_pc~0)|)) (.cse12 (= 1 ~E_1~0)) (.cse13 (= 1 ~E_2~0)) (.cse14 (not .cse22)) (.cse15 (= 0 ~E_1~0)) (.cse16 (not (= 1 ~t1_i~0))) (.cse17 (not (= 1 ~t2_i~0))) (.cse18 (= 0 |old(~E_M~0)|)) (.cse19 (= 0 ~E_2~0)) (.cse21 (not (<= ~t1_pc~0 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (or .cse0 .cse1 .cse2 .cse4 .cse6 .cse7 .cse8 .cse9 .cse20 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse21 .cse22) (or .cse0 .cse1 .cse3 .cse5 .cse6 .cse7 .cse9 .cse23 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse9 .cse23 .cse20 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse22) (let ((.cse24 (+ ~local~0 1))) (or .cse0 .cse1 .cse3 .cse5 .cse6 .cse7 .cse9 .cse23 (not (<= .cse24 |old(~token~0)|)) .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 (and (<= 2 ~m_st~0) (= |old(~token~0)| ~token~0) (= 1 ~t2_pc~0) (= |old(~t1_st~0)| ~t1_st~0) (= ~E_M~0 |old(~E_M~0)|)) .cse17 (not (<= |old(~token~0)| .cse24)) .cse18 .cse19)) (or .cse0 .cse1 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse21)))) [2019-10-02 16:21:02,594 INFO L439 ceAbstractionStarter]: At program point L145(lines 116 151) the Hoare annotation is: (let ((.cse31 (= 1 ~m_pc~0)) (.cse22 (<= 2 ~m_st~0)) (.cse32 (= ~m_st~0 0)) (.cse23 (<= ~token~0 ~local~0)) (.cse24 (= 1 ~t2_pc~0)) (.cse25 (<= 2 ~t2_st~0)) (.cse26 (= |old(~t1_st~0)| ~t1_st~0)) (.cse27 (= ~E_M~0 |old(~E_M~0)|)) (.cse28 (<= ~local~0 ~token~0))) (let ((.cse6 (not (= |old(~t1_st~0)| 0))) (.cse18 (not (<= ~t1_pc~0 0))) (.cse19 (not (<= |old(~token~0)| ~local~0))) (.cse21 (not (<= ~local~0 |old(~token~0)|))) (.cse30 (not (= 0 |old(~m_st~0)|))) (.cse29 (and .cse32 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28)) (.cse0 (= ~T1_E~0 0)) (.cse1 (= ~T2_E~0 1)) (.cse20 (not (= ~t1_pc~0 1))) (.cse3 (not (<= 2 |old(~m_st~0)|))) (.cse4 (= ~T2_E~0 0)) (.cse2 (and .cse22 .cse24 .cse25 .cse26 .cse27)) (.cse5 (= 1 ~M_E~0)) (.cse7 (= 1 |old(~E_M~0)|)) (.cse36 (not (<= 2 |old(~t1_st~0)|))) (.cse8 (not (= ~m_i~0 1))) (.cse9 (= 1 |old(~t2_pc~0)|)) (.cse10 (= 1 ~E_1~0)) (.cse11 (= 1 ~E_2~0)) (.cse12 (not .cse31)) (.cse13 (= 0 ~E_1~0)) (.cse14 (not (= 1 ~t1_i~0))) (.cse15 (not (= 1 ~t2_i~0))) (.cse16 (= 0 |old(~E_M~0)|)) (.cse17 (= 0 ~E_2~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (or .cse0 .cse1 .cse19 .cse20 .cse21 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (and .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28) .cse15 .cse16 .cse17) (or .cse0 .cse29 .cse1 .cse19 .cse21 .cse4 .cse5 .cse6 .cse7 .cse30 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse31) (let ((.cse33 (not (= ~E_M~0 0))) (.cse34 (not (= ~E_M~0 1))) (.cse37 (+ ~local~0 1))) (or .cse0 .cse1 (let ((.cse35 (+ ~local~0 2))) (and .cse32 .cse33 .cse34 (<= ~token~0 .cse35) .cse24 .cse25 .cse26 (<= .cse35 ~token~0))) .cse20 .cse3 .cse4 .cse5 .cse7 .cse36 (not (<= .cse37 |old(~token~0)|)) .cse8 .cse10 (and .cse22 .cse33 .cse34 .cse24 .cse25 .cse26) .cse11 .cse12 .cse13 .cse14 .cse15 (not (<= |old(~token~0)| .cse37)) .cse16 .cse17)) (or .cse0 .cse1 .cse19 .cse20 .cse21 .cse4 .cse5 .cse7 .cse36 .cse30 .cse8 .cse9 .cse10 .cse11 .cse29 .cse13 .cse14 .cse15 .cse16 .cse17 .cse31) (or .cse0 .cse1 .cse20 .cse3 .cse4 .cse2 .cse5 .cse7 .cse36 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17)))) [2019-10-02 16:21:02,594 INFO L443 ceAbstractionStarter]: For program point transmit2EXIT(lines 116 151) no Hoare annotation was computed. [2019-10-02 16:21:02,595 INFO L439 ceAbstractionStarter]: At program point L141(line 141) the Hoare annotation is: (let ((.cse25 (= 1 ~m_pc~0))) (let ((.cse19 (not (<= |old(~token~0)| ~local~0))) (.cse2 (not (= ~t1_pc~0 1))) (.cse20 (not (<= ~local~0 |old(~token~0)|))) (.cse7 (not (<= 2 |old(~t1_st~0)|))) (.cse23 (not (= 0 |old(~m_st~0)|))) (.cse0 (= ~T1_E~0 0)) (.cse1 (= ~T2_E~0 1)) (.cse3 (not (<= 2 |old(~m_st~0)|))) (.cse4 (= ~T2_E~0 0)) (.cse5 (= 1 ~M_E~0)) (.cse21 (not (= |old(~t1_st~0)| 0))) (.cse6 (= 1 |old(~E_M~0)|)) (.cse9 (not (= ~m_i~0 1))) (.cse22 (= 1 |old(~t2_pc~0)|)) (.cse10 (= 1 ~E_1~0)) (.cse11 (= 1 ~E_2~0)) (.cse12 (not .cse25)) (.cse14 (= 0 ~E_1~0)) (.cse15 (not (= 1 ~t1_i~0))) (.cse16 (not (= 1 ~t2_i~0))) (.cse17 (= 0 |old(~E_M~0)|)) (.cse18 (= 0 ~E_2~0)) (.cse24 (not (<= ~t1_pc~0 0)))) (and (let ((.cse8 (+ ~local~0 1))) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (<= .cse8 |old(~token~0)|)) .cse9 .cse10 .cse11 .cse12 (let ((.cse13 (+ ~local~0 2))) (and (<= 2 ~m_st~0) (not (= ~E_M~0 0)) (<= ~token~0 .cse13) (= 1 ~t2_pc~0) (= |old(~t1_st~0)| ~t1_st~0) (<= .cse13 ~token~0))) .cse14 .cse15 .cse16 (not (<= |old(~token~0)| .cse8)) .cse17 .cse18)) (or .cse0 .cse1 .cse19 .cse2 .cse20 .cse3 .cse4 .cse5 .cse21 .cse6 .cse9 .cse22 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18) (or .cse0 .cse1 .cse19 .cse20 .cse4 .cse5 .cse21 .cse6 .cse23 .cse9 .cse22 .cse10 .cse11 .cse14 .cse15 .cse16 .cse17 .cse18 .cse24 .cse25) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse22 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18) (or .cse0 .cse1 .cse19 .cse2 .cse20 .cse4 .cse5 .cse6 .cse7 .cse23 .cse9 .cse22 .cse10 .cse11 .cse14 .cse15 .cse16 .cse17 .cse18 .cse25) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse21 .cse6 .cse9 .cse22 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse24)))) [2019-10-02 16:21:02,595 INFO L443 ceAbstractionStarter]: For program point L141-1(line 141) no Hoare annotation was computed. [2019-10-02 16:21:02,596 INFO L439 ceAbstractionStarter]: At program point L131-1(lines 119 150) the Hoare annotation is: (let ((.cse30 (= 1 ~m_pc~0)) (.cse0 (= ~T1_E~0 0)) (.cse4 (= ~T2_E~0 0)) (.cse6 (<= 2 ~m_st~0)) (.cse7 (not (= ~E_M~0 0))) (.cse12 (= ~m_st~0 0)) (.cse8 (= |old(~t1_st~0)| ~t1_st~0)) (.cse34 (<= ~token~0 ~local~0)) (.cse24 (= ~E_M~0 |old(~E_M~0)|)) (.cse35 (<= ~local~0 ~token~0))) (let ((.cse11 (not (<= 2 |old(~t1_st~0)|))) (.cse26 (and .cse12 .cse8 .cse34 .cse24 .cse35)) (.cse29 (not (= 0 |old(~m_st~0)|))) (.cse27 (not (<= |old(~token~0)| ~local~0))) (.cse2 (not (= ~t1_pc~0 1))) (.cse28 (not (<= ~local~0 |old(~token~0)|))) (.cse33 (and (= ~m_pc~0 1) (not .cse0) (not .cse4) .cse6 (= ~t1_i~0 1) (not (= ~E_1~0 0)) .cse7 (= 0 ~t1_st~0) (not (= ~E_2~0 0)))) (.cse1 (= ~T2_E~0 1)) (.cse3 (not (<= 2 |old(~m_st~0)|))) (.cse5 (= 1 ~M_E~0)) (.cse31 (not (= |old(~t1_st~0)| 0))) (.cse10 (= 1 |old(~E_M~0)|)) (.cse15 (not (= ~m_i~0 1))) (.cse25 (= 1 |old(~t2_pc~0)|)) (.cse16 (= 1 ~E_1~0)) (.cse17 (= 1 ~E_2~0)) (.cse18 (not .cse30)) (.cse19 (= 0 ~E_1~0)) (.cse20 (not (= 1 ~t1_i~0))) (.cse21 (not (= 1 ~t2_i~0))) (.cse22 (= 0 |old(~E_M~0)|)) (.cse23 (= 0 ~E_2~0)) (.cse32 (not (<= ~t1_pc~0 0)))) (and (let ((.cse9 (not (= ~E_M~0 1))) (.cse14 (+ ~local~0 1))) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (and (and .cse6 .cse7) .cse8 .cse9) .cse10 .cse11 (let ((.cse13 (+ ~local~0 2))) (and .cse12 .cse7 .cse8 (<= .cse13 ~token~0) .cse9 (<= ~token~0 .cse13))) (not (<= .cse14 |old(~token~0)|)) .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 (not (<= |old(~token~0)| .cse14)) .cse22 .cse23)) (or .cse0 (and .cse6 .cse8 .cse24) .cse1 .cse2 .cse3 .cse4 .cse5 .cse10 .cse11 .cse15 .cse25 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (or .cse0 .cse26 .cse1 .cse27 .cse2 .cse28 .cse4 .cse5 .cse10 .cse11 .cse29 .cse15 .cse25 .cse16 .cse17 .cse19 .cse20 .cse21 .cse22 .cse23 .cse30) (or .cse26 .cse0 .cse1 .cse27 .cse28 .cse4 .cse5 .cse31 .cse10 .cse29 .cse15 .cse25 .cse16 .cse17 .cse19 .cse20 .cse21 .cse22 .cse23 .cse32 .cse30) (or .cse0 .cse1 .cse27 .cse2 .cse28 .cse3 .cse4 .cse5 .cse31 .cse10 .cse15 .cse25 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 (and .cse33 .cse34 .cse24 .cse35)) (or .cse0 (and .cse33 .cse24) .cse1 .cse3 .cse4 .cse5 .cse31 .cse10 .cse15 .cse25 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse32)))) [2019-10-02 16:21:02,596 INFO L443 ceAbstractionStarter]: For program point L123(lines 123 127) no Hoare annotation was computed. [2019-10-02 16:21:02,596 INFO L439 ceAbstractionStarter]: At program point transmit2ENTRY(lines 116 151) the Hoare annotation is: (let ((.cse20 (= 1 ~m_pc~0)) (.cse24 (<= 2 ~m_st~0)) (.cse30 (not (= ~t2_pc~0 1))) (.cse31 (<= ~token~0 ~local~0)) (.cse25 (= |old(~t1_st~0)| ~t1_st~0)) (.cse26 (= ~E_M~0 |old(~E_M~0)|)) (.cse32 (<= ~local~0 ~token~0))) (let ((.cse10 (not (= 0 |old(~m_st~0)|))) (.cse7 (and .cse30 (= ~m_st~0 0) .cse31 .cse25 .cse26 .cse32)) (.cse29 (not (<= ~t1_pc~0 0))) (.cse28 (and .cse30 .cse24 .cse25 .cse26)) (.cse9 (not (<= 2 |old(~t1_st~0)|))) (.cse0 (= ~T1_E~0 0)) (.cse1 (= ~T2_E~0 1)) (.cse2 (not (<= |old(~token~0)| ~local~0))) (.cse3 (not (= ~t1_pc~0 1))) (.cse4 (not (<= ~local~0 |old(~token~0)|))) (.cse21 (not (<= 2 |old(~m_st~0)|))) (.cse5 (= ~T2_E~0 0)) (.cse6 (= 1 ~M_E~0)) (.cse27 (not (= |old(~t1_st~0)| 0))) (.cse8 (= 1 |old(~E_M~0)|)) (.cse11 (not (= ~m_i~0 1))) (.cse12 (= 1 |old(~t2_pc~0)|)) (.cse13 (= 1 ~E_1~0)) (.cse14 (= 1 ~E_2~0)) (.cse23 (not .cse20)) (.cse15 (= 0 ~E_1~0)) (.cse16 (not (= 1 ~t1_i~0))) (.cse17 (not (= 1 ~t2_i~0))) (.cse18 (= 0 |old(~E_M~0)|)) (.cse19 (= 0 ~E_2~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (let ((.cse22 (+ ~local~0 1))) (or .cse0 .cse1 .cse3 .cse21 .cse5 .cse6 .cse8 (not .cse12) .cse9 (not (<= .cse22 |old(~token~0)|)) .cse11 .cse13 .cse14 .cse23 .cse15 .cse16 (and .cse24 (= |old(~token~0)| ~token~0) (= 1 ~t2_pc~0) .cse25 .cse26) .cse17 (not (<= |old(~token~0)| .cse22)) .cse18 .cse19)) (or .cse0 .cse1 .cse21 .cse5 .cse6 .cse27 .cse8 .cse11 .cse12 .cse13 .cse14 .cse23 .cse15 .cse16 .cse28 .cse17 .cse18 .cse19 .cse29) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse27 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse7 .cse29 .cse20) (or .cse0 .cse28 .cse1 .cse3 .cse21 .cse5 .cse6 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse23 .cse15 .cse16 .cse17 .cse18 .cse19) (or .cse0 .cse1 .cse2 .cse3 .cse4 (and .cse30 .cse24 .cse31 .cse25 .cse26 .cse32) .cse21 .cse5 .cse6 .cse27 .cse8 .cse11 .cse12 .cse13 .cse14 .cse23 .cse15 .cse16 .cse17 .cse18 .cse19)))) [2019-10-02 16:21:02,596 INFO L443 ceAbstractionStarter]: For program point L132(line 132) no Hoare annotation was computed. [2019-10-02 16:21:02,596 INFO L443 ceAbstractionStarter]: For program point exists_runnable_threadEXIT(lines 240 264) no Hoare annotation was computed. [2019-10-02 16:21:02,597 INFO L443 ceAbstractionStarter]: For program point L252(lines 252 257) no Hoare annotation was computed. [2019-10-02 16:21:02,597 INFO L443 ceAbstractionStarter]: For program point L248(lines 248 258) no Hoare annotation was computed. [2019-10-02 16:21:02,597 INFO L446 ceAbstractionStarter]: At program point exists_runnable_threadENTRY(lines 240 264) the Hoare annotation is: true [2019-10-02 16:21:02,597 INFO L443 ceAbstractionStarter]: For program point L244(lines 244 259) no Hoare annotation was computed. [2019-10-02 16:21:02,597 INFO L439 ceAbstractionStarter]: At program point L261(lines 243 263) the Hoare annotation is: (let ((.cse26 (= 1 ~m_pc~0))) (let ((.cse5 (not (<= 2 ~m_st~0))) (.cse14 (not .cse26)) (.cse11 (= 1 ~t2_pc~0)) (.cse3 (not (= ~t1_pc~0 1))) (.cse24 (not (<= 2 ~t1_st~0))) (.cse0 (= ~T1_E~0 0)) (.cse22 (not (<= 2 ~t2_st~0))) (.cse1 (= ~T2_E~0 1)) (.cse2 (not (<= ~token~0 ~local~0))) (.cse4 (not (<= ~local~0 ~token~0))) (.cse6 (= ~T2_E~0 0)) (.cse7 (= 1 ~M_E~0)) (.cse8 (not (= ~t1_st~0 0))) (.cse9 (= 1 ~E_M~0)) (.cse25 (not (= 0 ~m_st~0))) (.cse10 (not (= ~m_i~0 1))) (.cse12 (= 1 ~E_1~0)) (.cse13 (= 1 ~E_2~0)) (.cse15 (= 0 ~E_1~0)) (.cse17 (= exists_runnable_thread_~__retres1~3 1)) (.cse16 (not (= 1 ~t1_i~0))) (.cse18 (not (= 1 ~t2_i~0))) (.cse19 (= 0 ~E_M~0)) (.cse20 (= 0 ~E_2~0)) (.cse21 (not (<= ~t1_pc~0 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (or .cse0 .cse17 .cse1 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse18 .cse19 .cse20 .cse21) (let ((.cse23 (+ ~local~0 2))) (or .cse0 .cse22 .cse1 (not (<= ~token~0 .cse23)) .cse3 .cse6 .cse17 .cse7 .cse9 (not .cse11) .cse24 .cse25 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse18 .cse19 .cse20 (not (<= .cse23 ~token~0)))) (or .cse0 .cse22 .cse17 .cse1 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse18 .cse19 .cse20 .cse21) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse9 .cse24 .cse25 .cse10 .cse11 .cse12 .cse13 .cse17 .cse15 .cse16 .cse18 .cse19 .cse20 .cse26) (or .cse0 .cse22 .cse1 .cse2 .cse3 .cse4 .cse17 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse18 .cse19 .cse20) (or .cse0 .cse1 .cse2 .cse4 .cse17 .cse6 .cse7 .cse8 .cse9 .cse25 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse18 .cse19 .cse20 .cse21 .cse26) (or .cse0 .cse22 .cse1 .cse2 .cse3 .cse4 .cse17 .cse6 .cse7 .cse9 .cse24 .cse25 .cse10 .cse12 .cse13 .cse15 .cse16 .cse18 .cse19 .cse20 .cse26) (or .cse0 .cse22 .cse1 .cse2 .cse4 .cse6 .cse7 .cse8 .cse9 .cse25 .cse10 .cse12 .cse13 .cse15 .cse17 .cse16 .cse18 .cse19 .cse20 .cse21 .cse26)))) [2019-10-02 16:21:02,597 INFO L443 ceAbstractionStarter]: For program point exists_runnable_threadFINAL(lines 240 264) no Hoare annotation was computed. [2019-10-02 16:21:02,598 INFO L443 ceAbstractionStarter]: For program point is_transmit1_triggeredFINAL(lines 171 189) no Hoare annotation was computed. [2019-10-02 16:21:02,598 INFO L439 ceAbstractionStarter]: At program point L186(lines 174 188) the Hoare annotation is: (let ((.cse16 (= 1 ~m_pc~0)) (.cse9 (= 1 ~t2_pc~0)) (.cse5 (= 1 ~E_M~0)) (.cse31 (+ ~local~0 1)) (.cse26 (= ~t1_st~0 0)) (.cse20 (= 1 ~E_1~0))) (let ((.cse6 (not .cse20)) (.cse4 (not .cse26)) (.cse15 (not (<= ~t1_pc~0 0))) (.cse23 (not (<= 2 ~t2_st~0))) (.cse18 (not (<= 2 ~m_st~0))) (.cse24 (not (<= .cse31 ~token~0))) (.cse25 (not (<= ~token~0 .cse31))) (.cse13 (= 0 ~E_M~0)) (.cse28 (not .cse5)) (.cse0 (= ~T1_E~0 0)) (.cse1 (= ~T2_E~0 1)) (.cse17 (not (= ~t1_pc~0 1))) (.cse2 (= ~T2_E~0 0)) (.cse3 (= 1 ~M_E~0)) (.cse29 (not .cse9)) (.cse19 (not (<= 2 ~t1_st~0))) (.cse27 (not (= 0 ~m_st~0))) (.cse7 (= is_transmit1_triggered_~__retres1~1 0)) (.cse8 (not (= ~m_i~0 1))) (.cse10 (= 1 ~E_2~0)) (.cse21 (not .cse16)) (.cse22 (= 0 ~E_1~0)) (.cse11 (not (= 1 ~t1_i~0))) (.cse12 (not (= 1 ~t2_i~0))) (.cse14 (= 0 ~E_2~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse0 .cse1 .cse17 .cse18 .cse2 .cse5 .cse19 .cse8 .cse9 .cse20 .cse7 .cse10 .cse21 .cse22 .cse11 .cse12 .cse13 .cse14) (or .cse7 .cse0 .cse23 .cse1 .cse17 .cse18 .cse2 .cse5 .cse19 .cse8 .cse20 .cse10 .cse21 .cse22 .cse11 .cse12 .cse13 .cse14) (or .cse0 .cse1 .cse17 .cse7 .cse18 .cse2 .cse5 .cse19 .cse24 .cse8 .cse20 .cse10 .cse21 .cse22 .cse11 .cse12 .cse25 .cse13 .cse14) (or .cse0 .cse1 .cse17 .cse18 .cse2 .cse3 .cse5 .cse8 .cse9 .cse20 .cse21 .cse22 .cse11 .cse12 .cse13 .cse14 .cse26 .cse7) (or .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse0 .cse1 (not (<= ~token~0 ~local~0)) (not (<= ~local~0 ~token~0)) .cse2 .cse4 .cse5 .cse27 .cse8 .cse9 .cse20 .cse10 .cse22 .cse11 .cse12 .cse13 .cse14 .cse7 .cse15 .cse16) (or .cse28 .cse0 .cse1 .cse17 .cse18 .cse2 .cse3 .cse29 .cse19 .cse8 .cse20 .cse10 .cse21 .cse22 .cse11 .cse12 .cse14 .cse7) (or .cse0 .cse23 .cse1 .cse17 .cse18 .cse2 .cse3 .cse5 .cse24 .cse8 .cse20 .cse21 .cse22 .cse11 .cse12 .cse25 .cse13 .cse14 .cse26 .cse7) (let ((.cse30 (+ ~local~0 2))) (or .cse28 .cse0 .cse1 (not (<= ~token~0 .cse30)) .cse17 .cse2 .cse3 .cse29 .cse19 .cse27 .cse7 .cse8 .cse20 .cse10 .cse21 .cse22 .cse11 .cse12 .cse14 (not (<= .cse30 ~token~0))))))) [2019-10-02 16:21:02,598 INFO L446 ceAbstractionStarter]: At program point is_transmit1_triggeredENTRY(lines 171 189) the Hoare annotation is: true [2019-10-02 16:21:02,598 INFO L443 ceAbstractionStarter]: For program point is_transmit1_triggeredEXIT(lines 171 189) no Hoare annotation was computed. [2019-10-02 16:21:02,599 INFO L443 ceAbstractionStarter]: For program point L176(lines 176 181) no Hoare annotation was computed. [2019-10-02 16:21:02,599 INFO L443 ceAbstractionStarter]: For program point L175(lines 175 184) no Hoare annotation was computed. [2019-10-02 16:21:02,599 INFO L443 ceAbstractionStarter]: For program point L175-2(lines 175 184) no Hoare annotation was computed. [2019-10-02 16:21:02,599 INFO L443 ceAbstractionStarter]: For program point L382-1(lines 371 404) no Hoare annotation was computed. [2019-10-02 16:21:02,599 INFO L439 ceAbstractionStarter]: At program point reset_delta_eventsENTRY(lines 368 405) the Hoare annotation is: (let ((.cse14 (= 1 ~m_pc~0)) (.cse19 (= |old(~T2_E~0)| ~T2_E~0)) (.cse22 (= ~E_1~0 |old(~E_1~0)|)) (.cse24 (= ~E_2~0 |old(~E_2~0)|)) (.cse20 (= ~M_E~0 |old(~M_E~0)|)) (.cse21 (= |old(~T1_E~0)| ~T1_E~0)) (.cse23 (= ~E_M~0 |old(~E_M~0)|))) (let ((.cse6 (= 1 ~t2_pc~0)) (.cse0 (= |old(~T1_E~0)| 0)) (.cse1 (= |old(~T2_E~0)| 1)) (.cse15 (not (= ~t1_pc~0 1))) (.cse16 (not (<= 2 ~m_st~0))) (.cse3 (= |old(~T2_E~0)| 0)) (.cse2 (and .cse19 .cse22 .cse24 .cse20 .cse21 .cse23)) (.cse4 (= 1 |old(~E_M~0)|)) (.cse17 (not (<= 2 ~t1_st~0))) (.cse5 (not (= ~m_i~0 1))) (.cse7 (= 1 |old(~E_1~0)|)) (.cse8 (= 1 |old(~E_2~0)|)) (.cse18 (not .cse14)) (.cse9 (= 0 |old(~E_1~0)|)) (.cse10 (not (= 1 ~t1_i~0))) (.cse11 (not (= 1 ~t2_i~0))) (.cse12 (= 0 |old(~E_M~0)|)) (.cse13 (= 0 |old(~E_2~0)|))) (and (or .cse0 .cse1 (not (<= ~token~0 ~local~0)) (not (<= ~local~0 ~token~0)) .cse2 .cse3 (not (= ~t1_st~0 0)) .cse4 (not (= 0 ~m_st~0)) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (not (<= ~t1_pc~0 0)) .cse14) (or .cse0 .cse1 .cse15 .cse16 .cse3 .cse4 .cse17 .cse5 .cse6 .cse7 .cse8 .cse18 .cse9 .cse10 .cse11 .cse12 .cse13 (and .cse19 .cse20 .cse21 .cse22 .cse23 .cse24)) (or .cse0 (not (<= 2 ~t2_st~0)) .cse1 .cse15 .cse16 .cse3 .cse4 .cse17 .cse5 .cse7 .cse8 .cse18 .cse9 .cse2 .cse10 .cse11 .cse12 .cse13) (let ((.cse25 (+ ~local~0 1))) (or .cse0 .cse1 .cse15 .cse16 .cse3 .cse2 .cse4 .cse17 (not (<= .cse25 ~token~0)) .cse5 .cse7 .cse8 .cse18 .cse9 .cse10 .cse11 (not (<= ~token~0 .cse25)) .cse12 .cse13))))) [2019-10-02 16:21:02,599 INFO L443 ceAbstractionStarter]: For program point L372-1(lines 371 404) no Hoare annotation was computed. [2019-10-02 16:21:02,599 INFO L443 ceAbstractionStarter]: For program point L397-1(lines 368 405) no Hoare annotation was computed. [2019-10-02 16:21:02,600 INFO L443 ceAbstractionStarter]: For program point L387-1(lines 371 404) no Hoare annotation was computed. [2019-10-02 16:21:02,600 INFO L443 ceAbstractionStarter]: For program point L377-1(lines 371 404) no Hoare annotation was computed. [2019-10-02 16:21:02,600 INFO L443 ceAbstractionStarter]: For program point reset_delta_eventsEXIT(lines 368 405) no Hoare annotation was computed. [2019-10-02 16:21:02,600 INFO L443 ceAbstractionStarter]: For program point L392-1(lines 371 404) no Hoare annotation was computed. [2019-10-02 16:21:02,600 INFO L443 ceAbstractionStarter]: For program point L226-1(lines 220 238) no Hoare annotation was computed. [2019-10-02 16:21:02,600 INFO L443 ceAbstractionStarter]: For program point L221-1(lines 220 238) no Hoare annotation was computed. [2019-10-02 16:21:02,600 INFO L443 ceAbstractionStarter]: For program point init_threadsEXIT(lines 217 239) no Hoare annotation was computed. [2019-10-02 16:21:02,600 INFO L439 ceAbstractionStarter]: At program point init_threadsENTRY(lines 217 239) the Hoare annotation is: (or (= ~T1_E~0 0) (= ~T2_E~0 1) (not (<= ~token~0 ~local~0)) (not (<= ~local~0 ~token~0)) (= ~T2_E~0 0) (= 1 ~M_E~0) (not (= |old(~t1_st~0)| 0)) (= 1 ~E_M~0) (not (= 0 |old(~m_st~0)|)) (not (= ~m_i~0 1)) (= 1 ~t2_pc~0) (= 1 ~E_1~0) (= 1 ~E_2~0) (= 0 ~E_1~0) (not (= 1 ~t1_i~0)) (not (= 1 ~t2_i~0)) (= 0 ~E_M~0) (= 0 ~E_2~0) (and (= ~m_st~0 0) (= |old(~t1_st~0)| ~t1_st~0)) (not (<= ~t1_pc~0 0)) (= 1 ~m_pc~0)) [2019-10-02 16:21:02,601 INFO L443 ceAbstractionStarter]: For program point L231-1(lines 217 239) no Hoare annotation was computed. [2019-10-02 16:21:02,601 INFO L443 ceAbstractionStarter]: For program point L593(line 593) no Hoare annotation was computed. [2019-10-02 16:21:02,601 INFO L439 ceAbstractionStarter]: At program point L592(line 592) the Hoare annotation is: (or (= |old(~T1_E~0)| 0) (and (not (= ~t2_pc~0 1)) (<= ~t1_pc~0 0) (not (= ~t1_i~0 1)) (= ~m_st~0 0) (not (= 1 ~m_i~0)) (not (= ~m_pc~0 1)) (= |old(~token~0)| ~token~0) (= |old(~T2_E~0)| ~T2_E~0) (not (= ~t2_i~0 1)) (= ~E_1~0 |old(~E_1~0)|) (<= ~token~0 ~local~0) (= ~E_2~0 |old(~E_2~0)|) (= |old(~t1_st~0)| ~t1_st~0) (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (<= ~local~0 ~token~0)) (= 1 |old(~t2_i~0)|) (= |old(~T2_E~0)| 1) (not (<= |old(~token~0)| |old(~local~0)|)) (not (<= |old(~local~0)| |old(~token~0)|)) (= 1 |old(~t1_i~0)|) (= |old(~T2_E~0)| 0) (= 1 |old(~M_E~0)|) (= |old(~m_i~0)| 1) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~E_M~0)|) (not (= 0 |old(~m_st~0)|)) (= 1 |old(~t2_pc~0)|) (= 1 |old(~E_1~0)|) (= 1 |old(~E_2~0)|) (= 0 |old(~E_1~0)|) (= 0 |old(~E_M~0)|) (= 0 |old(~E_2~0)|) (not (<= |old(~t1_pc~0)| 0)) (= 1 |old(~m_pc~0)|)) [2019-10-02 16:21:02,601 INFO L439 ceAbstractionStarter]: At program point L592-1(line 592) the Hoare annotation is: (or (= |old(~T1_E~0)| 0) (= 1 |old(~t2_i~0)|) (= |old(~T2_E~0)| 1) (not (<= |old(~token~0)| |old(~local~0)|)) (not (<= |old(~local~0)| |old(~token~0)|)) (= 1 |old(~t1_i~0)|) (= |old(~T2_E~0)| 0) (= 1 |old(~M_E~0)|) (= |old(~m_i~0)| 1) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~E_M~0)|) (not (= 0 |old(~m_st~0)|)) (= 1 |old(~t2_pc~0)|) (= 1 |old(~E_1~0)|) (= 1 |old(~E_2~0)|) (= 0 |old(~E_1~0)|) (= 0 |old(~E_M~0)|) (= 0 |old(~E_2~0)|) (and (not (= ~t2_pc~0 1)) (<= ~t1_pc~0 0) (= ~m_st~0 0) (not (= ~m_pc~0 1)) (= |old(~token~0)| ~token~0) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= 1 ~m_i~0) (<= ~token~0 ~local~0) (= ~t2_i~0 1) (= ~E_2~0 |old(~E_2~0)|) (= ~t1_i~0 1) (= |old(~t1_st~0)| ~t1_st~0) (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (<= ~local~0 ~token~0)) (not (<= |old(~t1_pc~0)| 0)) (= 1 |old(~m_pc~0)|)) [2019-10-02 16:21:02,602 INFO L439 ceAbstractionStarter]: At program point mainENTRY(lines 587 598) the Hoare annotation is: (or (= |old(~T1_E~0)| 0) (and (not (= ~t2_pc~0 1)) (<= ~t1_pc~0 0) (not (= ~t1_i~0 1)) (= ~m_st~0 0) (not (= 1 ~m_i~0)) (not (= ~m_pc~0 1)) (= |old(~token~0)| ~token~0) (= |old(~T2_E~0)| ~T2_E~0) (not (= ~t2_i~0 1)) (= ~E_1~0 |old(~E_1~0)|) (<= ~token~0 ~local~0) (= ~E_2~0 |old(~E_2~0)|) (= |old(~t1_st~0)| ~t1_st~0) (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (<= ~local~0 ~token~0)) (= 1 |old(~t2_i~0)|) (= |old(~T2_E~0)| 1) (not (<= |old(~token~0)| |old(~local~0)|)) (not (<= |old(~local~0)| |old(~token~0)|)) (= 1 |old(~t1_i~0)|) (= |old(~T2_E~0)| 0) (= 1 |old(~M_E~0)|) (= |old(~m_i~0)| 1) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~E_M~0)|) (not (= 0 |old(~m_st~0)|)) (= 1 |old(~t2_pc~0)|) (= 1 |old(~E_1~0)|) (= 1 |old(~E_2~0)|) (= 0 |old(~E_1~0)|) (= 0 |old(~E_M~0)|) (= 0 |old(~E_2~0)|) (not (<= |old(~t1_pc~0)| 0)) (= 1 |old(~m_pc~0)|)) [2019-10-02 16:21:02,602 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 587 598) no Hoare annotation was computed. [2019-10-02 16:21:02,602 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 587 598) no Hoare annotation was computed. [2019-10-02 16:21:02,602 INFO L443 ceAbstractionStarter]: For program point errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 10) no Hoare annotation was computed. [2019-10-02 16:21:02,602 INFO L443 ceAbstractionStarter]: For program point errorEXIT(lines 6 13) no Hoare annotation was computed. [2019-10-02 16:21:02,602 INFO L446 ceAbstractionStarter]: At program point errorENTRY(lines 6 13) the Hoare annotation is: true [2019-10-02 16:21:02,602 INFO L443 ceAbstractionStarter]: For program point errorFINAL(lines 6 13) no Hoare annotation was computed. [2019-10-02 16:21:02,603 INFO L443 ceAbstractionStarter]: For program point masterEXIT(lines 36 79) no Hoare annotation was computed. [2019-10-02 16:21:02,603 INFO L443 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2019-10-02 16:21:02,603 INFO L439 ceAbstractionStarter]: At program point L44(lines 39 78) the Hoare annotation is: (let ((.cse5 (not (= |old(~t1_st~0)| 0))) (.cse15 (not (<= ~t1_pc~0 0))) (.cse17 (not (<= |old(~token~0)| |old(~local~0)|))) (.cse19 (not (<= |old(~local~0)| |old(~token~0)|))) (.cse0 (= ~T1_E~0 0)) (.cse1 (not (<= 2 |old(~t2_st~0)|))) (.cse2 (= ~T2_E~0 1)) (.cse18 (not (= ~t1_pc~0 1))) (.cse3 (= ~T2_E~0 0)) (.cse4 (= 1 ~M_E~0)) (.cse6 (= 1 ~E_M~0)) (.cse21 (= 1 ~t2_pc~0)) (.cse20 (not (<= 2 |old(~t1_st~0)|))) (.cse7 (not (= ~m_i~0 1))) (.cse8 (= 1 |old(~E_1~0)|)) (.cse9 (= 1 ~E_2~0)) (.cse16 (= 1 |old(~m_pc~0)|)) (.cse10 (= 0 |old(~E_1~0)|)) (.cse11 (not (= 1 ~t1_i~0))) (.cse12 (not (= 1 ~t2_i~0))) (.cse13 (= 0 ~E_M~0)) (.cse14 (= 0 ~E_2~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse0 .cse1 .cse2 .cse17 .cse18 .cse19 .cse3 .cse4 .cse6 .cse20 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16) (or .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse21 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse0 .cse2 .cse17 .cse18 .cse19 .cse3 .cse4 .cse6 .cse20 .cse7 .cse21 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16) (let ((.cse23 (+ |old(~local~0)| 2))) (or .cse0 (let ((.cse22 (+ ~local~0 2))) (and (= |old(~token~0)| ~token~0) (= ~E_1~0 |old(~E_1~0)|) (<= ~token~0 .cse22) (= ~m_pc~0 1) (<= 2 ~t2_st~0) (= |old(~t1_st~0)| ~t1_st~0) (<= .cse22 ~token~0))) .cse1 .cse2 (not (<= |old(~token~0)| .cse23)) .cse18 .cse3 .cse4 .cse6 (not .cse21) .cse20 .cse7 .cse8 .cse9 (not .cse16) .cse10 .cse11 .cse12 .cse13 .cse14 (not (<= .cse23 |old(~token~0)|)))))) [2019-10-02 16:21:02,604 INFO L439 ceAbstractionStarter]: At program point L73(lines 36 79) the Hoare annotation is: (let ((.cse0 (= ~T1_E~0 0)) (.cse4 (= 1 ~M_E~0)) (.cse10 (= 1 ~E_2~0)) (.cse3 (= ~T2_E~0 0))) (let ((.cse15 (= |old(~t1_st~0)| ~t1_st~0)) (.cse36 (= 1 ~t1_pc~0)) (.cse37 (not .cse3)) (.cse38 (not .cse10)) (.cse11 (<= 2 ~m_st~0)) (.cse39 (not (= 1 ~T2_E~0))) (.cse40 (= 1 ~m_i~0)) (.cse33 (<= ~token~0 ~local~0)) (.cse41 (not .cse4)) (.cse42 (not (= ~E_M~0 1))) (.cse12 (= ~m_pc~0 1)) (.cse34 (= 0 ~t1_st~0)) (.cse13 (not (= ~E_1~0 1))) (.cse14 (<= 2 ~t2_st~0)) (.cse43 (not .cse0)) (.cse16 (not (= ~E_1~0 0))) (.cse35 (<= ~local~0 ~token~0)) (.cse29 (= 1 ~t2_pc~0))) (let ((.cse5 (not (= |old(~t1_st~0)| 0))) (.cse22 (not (<= ~t1_pc~0 0))) (.cse1 (not (<= 2 |old(~t2_st~0)|))) (.cse7 (not .cse29)) (.cse27 (and .cse36 .cse37 .cse38 .cse11 .cse39 .cse40 .cse33 .cse41 .cse42 .cse12 .cse29 .cse34 .cse13 .cse14 .cse43 .cse16 .cse35)) (.cse28 (and .cse36 .cse37 .cse38 .cse11 (<= 2 ~t1_st~0) .cse39 .cse40 .cse41 .cse42 .cse12 .cse29 (= ~t1_i~0 1) .cse13 .cse14 .cse43 .cse15 .cse16)) (.cse2 (= ~T2_E~0 1)) (.cse31 (not (<= |old(~token~0)| |old(~local~0)|))) (.cse25 (not (= ~t1_pc~0 1))) (.cse32 (not (<= |old(~local~0)| |old(~token~0)|))) (.cse6 (= 1 ~E_M~0)) (.cse26 (not (<= 2 |old(~t1_st~0)|))) (.cse8 (not (= ~m_i~0 1))) (.cse9 (= 1 |old(~E_1~0)|)) (.cse30 (and .cse12 .cse11 .cse13 .cse15 .cse16)) (.cse17 (= 0 |old(~E_1~0)|)) (.cse18 (not (= 1 ~t1_i~0))) (.cse19 (not (= 1 ~t2_i~0))) (.cse20 (= 0 ~E_M~0)) (.cse21 (= 0 ~E_2~0)) (.cse23 (= 1 |old(~m_pc~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (and .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (let ((.cse24 (+ |old(~local~0)| 2))) (or .cse0 .cse1 .cse2 (not (<= |old(~token~0)| .cse24)) .cse25 .cse3 .cse4 .cse6 .cse7 .cse26 .cse8 .cse9 .cse10 (not .cse23) .cse27 .cse17 .cse28 .cse18 .cse19 .cse20 .cse21 (not (<= .cse24 |old(~token~0)|)))) (or .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse29 .cse9 .cse10 .cse30 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (or .cse0 .cse1 .cse2 .cse31 .cse25 .cse32 .cse3 .cse4 .cse6 .cse7 .cse26 .cse8 .cse9 .cse10 .cse27 .cse17 .cse18 .cse28 .cse19 .cse20 .cse21 .cse23) (or .cse0 .cse2 .cse31 .cse25 .cse32 .cse3 .cse4 .cse6 .cse26 (and .cse11 .cse33 .cse12 .cse34 .cse13 .cse16 .cse35) .cse8 .cse29 .cse9 .cse10 .cse30 .cse17 .cse18 .cse19 .cse20 .cse21 .cse23))))) [2019-10-02 16:21:02,604 INFO L439 ceAbstractionStarter]: At program point L67(line 67) the Hoare annotation is: (let ((.cse5 (not (= |old(~t1_st~0)| 0))) (.cse15 (not (<= ~t1_pc~0 0))) (.cse17 (not (<= |old(~token~0)| |old(~local~0)|))) (.cse19 (not (<= |old(~local~0)| |old(~token~0)|))) (.cse0 (= ~T1_E~0 0)) (.cse1 (not (<= 2 |old(~t2_st~0)|))) (.cse2 (= ~T2_E~0 1)) (.cse18 (not (= ~t1_pc~0 1))) (.cse3 (= ~T2_E~0 0)) (.cse4 (= 1 ~M_E~0)) (.cse6 (= 1 ~E_M~0)) (.cse21 (= 1 ~t2_pc~0)) (.cse20 (not (<= 2 |old(~t1_st~0)|))) (.cse7 (not (= ~m_i~0 1))) (.cse8 (= 1 |old(~E_1~0)|)) (.cse9 (= 1 ~E_2~0)) (.cse16 (= 1 |old(~m_pc~0)|)) (.cse10 (= 0 |old(~E_1~0)|)) (.cse11 (not (= 1 ~t1_i~0))) (.cse12 (not (= 1 ~t2_i~0))) (.cse13 (= 0 ~E_M~0)) (.cse14 (= 0 ~E_2~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse0 .cse1 .cse2 .cse17 .cse18 .cse19 .cse3 .cse4 .cse6 .cse20 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16) (or .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse21 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse0 .cse2 .cse17 .cse18 .cse19 .cse3 .cse4 .cse6 .cse20 .cse7 .cse21 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16) (let ((.cse22 (+ |old(~local~0)| 2))) (or .cse0 .cse1 .cse2 (not (<= |old(~token~0)| .cse22)) .cse18 .cse3 .cse4 .cse6 (not .cse21) .cse20 .cse7 .cse8 .cse9 (not .cse16) .cse10 .cse11 .cse12 .cse13 .cse14 (not (<= .cse22 |old(~token~0)|)))))) [2019-10-02 16:21:02,604 INFO L439 ceAbstractionStarter]: At program point L65(lines 39 78) the Hoare annotation is: (let ((.cse31 (= 1 ~t2_pc~0)) (.cse28 (= ~m_pc~0 1))) (let ((.cse12 (= |old(~token~0)| ~token~0)) (.cse14 (<= ~token~0 ~local~0)) (.cse17 (<= ~local~0 ~token~0)) (.cse3 (not (<= |old(~token~0)| |old(~local~0)|))) (.cse4 (not (= ~t1_pc~0 1))) (.cse5 (not (<= |old(~local~0)| |old(~token~0)|))) (.cse10 (not (<= 2 |old(~t1_st~0)|))) (.cse0 (= ~T1_E~0 0)) (.cse1 (not (<= 2 |old(~t2_st~0)|))) (.cse2 (= ~T2_E~0 1)) (.cse11 (not .cse28)) (.cse13 (= ~E_1~0 |old(~E_1~0)|)) (.cse15 (<= 2 ~t2_st~0)) (.cse16 (= |old(~t1_st~0)| ~t1_st~0)) (.cse6 (= ~T2_E~0 0)) (.cse7 (= 1 ~M_E~0)) (.cse30 (not (= |old(~t1_st~0)| 0))) (.cse8 (= 1 ~E_M~0)) (.cse9 (not .cse31)) (.cse18 (not (= ~m_i~0 1))) (.cse19 (= 1 |old(~E_1~0)|)) (.cse20 (= 1 ~E_2~0)) (.cse21 (= 0 |old(~E_1~0)|)) (.cse22 (not (= 1 ~t1_i~0))) (.cse23 (not (= 1 ~t2_i~0))) (.cse24 (= 0 ~E_M~0)) (.cse25 (= 0 ~E_2~0)) (.cse32 (not (<= ~t1_pc~0 0))) (.cse26 (= 1 |old(~m_pc~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (and .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26) (let ((.cse29 (+ |old(~local~0)| 2))) (or .cse0 (let ((.cse27 (+ ~local~0 2))) (and .cse12 .cse13 (<= ~token~0 .cse27) .cse28 .cse15 .cse16 (<= .cse27 ~token~0))) .cse1 .cse2 (not (<= |old(~token~0)| .cse29)) .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse18 .cse19 .cse20 (not .cse26) .cse21 .cse22 .cse23 .cse24 .cse25 (not (<= .cse29 |old(~token~0)|)))) (or (and .cse11 .cse16 .cse13) .cse0 .cse2 .cse6 .cse7 .cse30 .cse8 .cse18 .cse31 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse32 .cse26) (or (and .cse11 .cse12 .cse13 .cse14 .cse16 .cse17) .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse18 .cse31 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26) (or .cse0 .cse1 .cse2 (and .cse11 .cse13 .cse15 .cse16) .cse6 .cse7 .cse30 .cse8 .cse9 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse32 .cse26)))) [2019-10-02 16:21:02,605 INFO L439 ceAbstractionStarter]: At program point L57(line 57) the Hoare annotation is: (let ((.cse26 (= 1 ~t2_pc~0)) (.cse30 (= ~m_pc~0 1))) (let ((.cse3 (not (<= |old(~token~0)| |old(~local~0)|))) (.cse5 (not (<= |old(~local~0)| |old(~token~0)|))) (.cse19 (not .cse30)) (.cse27 (not (= |old(~t1_st~0)| 0))) (.cse28 (not (<= ~t1_pc~0 0))) (.cse0 (= ~T1_E~0 0)) (.cse1 (not (<= 2 |old(~t2_st~0)|))) (.cse2 (= ~T2_E~0 1)) (.cse4 (not (= ~t1_pc~0 1))) (.cse6 (= ~T2_E~0 0)) (.cse7 (= 1 ~M_E~0)) (.cse8 (= 1 ~E_M~0)) (.cse9 (not .cse26)) (.cse20 (= ~E_1~0 1)) (.cse21 (<= ~token~0 ~local~0)) (.cse22 (<= 2 ~t2_st~0)) (.cse23 (= |old(~t1_st~0)| ~t1_st~0)) (.cse24 (<= ~local~0 ~token~0)) (.cse10 (not (<= 2 |old(~t1_st~0)|))) (.cse11 (not (= ~m_i~0 1))) (.cse12 (= 1 |old(~E_1~0)|)) (.cse13 (= 1 ~E_2~0)) (.cse25 (= 1 |old(~m_pc~0)|)) (.cse14 (= 0 |old(~E_1~0)|)) (.cse15 (not (= 1 ~t1_i~0))) (.cse16 (not (= 1 ~t2_i~0))) (.cse17 (= 0 ~E_M~0)) (.cse18 (= 0 ~E_2~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (and .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) .cse25) (or .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse26 .cse12 .cse13 (and .cse19 .cse20 .cse21 .cse23 .cse24) .cse14 .cse15 .cse16 .cse17 .cse18 .cse25) (or .cse0 .cse2 .cse6 (and .cse19 .cse20 .cse23) .cse7 .cse27 .cse8 .cse11 .cse26 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse28 .cse25) (or .cse0 (and .cse19 .cse20 .cse22 .cse23) .cse1 .cse2 .cse6 .cse7 .cse27 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse28 .cse25) (let ((.cse29 (+ |old(~local~0)| 2))) (or .cse0 .cse1 .cse2 (not (<= |old(~token~0)| .cse29)) .cse4 .cse6 .cse7 .cse8 .cse9 (and .cse20 .cse21 .cse30 .cse22 .cse23 .cse24) .cse10 .cse11 .cse12 .cse13 (not .cse25) .cse14 .cse15 .cse16 .cse17 .cse18 (not (<= .cse29 |old(~token~0)|))))))) [2019-10-02 16:21:02,605 INFO L443 ceAbstractionStarter]: For program point L57-1(line 57) no Hoare annotation was computed. [2019-10-02 16:21:02,605 INFO L443 ceAbstractionStarter]: For program point L43(lines 43 47) no Hoare annotation was computed. [2019-10-02 16:21:02,605 INFO L439 ceAbstractionStarter]: At program point masterENTRY(lines 36 79) the Hoare annotation is: (let ((.cse31 (= 1 ~t2_pc~0)) (.cse28 (= ~m_pc~0 1))) (let ((.cse12 (= |old(~token~0)| ~token~0)) (.cse14 (<= ~token~0 ~local~0)) (.cse17 (<= ~local~0 ~token~0)) (.cse3 (not (<= |old(~token~0)| |old(~local~0)|))) (.cse4 (not (= ~t1_pc~0 1))) (.cse5 (not (<= |old(~local~0)| |old(~token~0)|))) (.cse10 (not (<= 2 |old(~t1_st~0)|))) (.cse0 (= ~T1_E~0 0)) (.cse1 (not (<= 2 |old(~t2_st~0)|))) (.cse2 (= ~T2_E~0 1)) (.cse11 (not .cse28)) (.cse13 (= ~E_1~0 |old(~E_1~0)|)) (.cse15 (<= 2 ~t2_st~0)) (.cse16 (= |old(~t1_st~0)| ~t1_st~0)) (.cse6 (= ~T2_E~0 0)) (.cse7 (= 1 ~M_E~0)) (.cse30 (not (= |old(~t1_st~0)| 0))) (.cse8 (= 1 ~E_M~0)) (.cse9 (not .cse31)) (.cse18 (not (= ~m_i~0 1))) (.cse19 (= 1 |old(~E_1~0)|)) (.cse20 (= 1 ~E_2~0)) (.cse21 (= 0 |old(~E_1~0)|)) (.cse22 (not (= 1 ~t1_i~0))) (.cse23 (not (= 1 ~t2_i~0))) (.cse24 (= 0 ~E_M~0)) (.cse25 (= 0 ~E_2~0)) (.cse32 (not (<= ~t1_pc~0 0))) (.cse26 (= 1 |old(~m_pc~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (and .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26) (let ((.cse29 (+ |old(~local~0)| 2))) (or .cse0 (let ((.cse27 (+ ~local~0 2))) (and .cse12 .cse13 (<= ~token~0 .cse27) .cse28 .cse15 .cse16 (<= .cse27 ~token~0))) .cse1 .cse2 (not (<= |old(~token~0)| .cse29)) .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse18 .cse19 .cse20 (not .cse26) .cse21 .cse22 .cse23 .cse24 .cse25 (not (<= .cse29 |old(~token~0)|)))) (or (and .cse11 .cse16 .cse13) .cse0 .cse2 .cse6 .cse7 .cse30 .cse8 .cse18 .cse31 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse32 .cse26) (or (and .cse11 .cse12 .cse13 .cse14 .cse16 .cse17) .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse18 .cse31 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26) (or .cse0 .cse1 .cse2 (and .cse11 .cse13 .cse15 .cse16) .cse6 .cse7 .cse30 .cse8 .cse9 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse32 .cse26)))) [2019-10-02 16:21:02,605 INFO L443 ceAbstractionStarter]: For program point fire_time_eventsEXIT(lines 451 459) no Hoare annotation was computed. [2019-10-02 16:21:02,606 INFO L439 ceAbstractionStarter]: At program point fire_time_eventsENTRY(lines 451 459) the Hoare annotation is: (let ((.cse0 (= ~T1_E~0 0)) (.cse1 (= ~T2_E~0 1)) (.cse2 (not (= ~t1_pc~0 1))) (.cse3 (not (<= 2 ~m_st~0))) (.cse4 (= ~T2_E~0 0)) (.cse6 (= 1 |old(~M_E~0)|)) (.cse7 (= 1 ~E_M~0)) (.cse8 (not (<= 2 ~t1_st~0))) (.cse9 (not (= ~m_i~0 1))) (.cse10 (= 1 ~E_1~0)) (.cse11 (= 1 ~E_2~0)) (.cse12 (not (= 1 ~m_pc~0))) (.cse13 (= 0 ~E_1~0)) (.cse14 (not (= 1 ~t1_i~0))) (.cse5 (= ~M_E~0 |old(~M_E~0)|)) (.cse15 (not (= 1 ~t2_i~0))) (.cse16 (= 0 ~E_M~0)) (.cse17 (= 0 ~E_2~0))) (and (or .cse0 (not (<= 2 ~t2_st~0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (or .cse0 .cse5 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 (= 1 ~t2_pc~0) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (let ((.cse18 (+ ~local~0 1))) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 (not (<= .cse18 ~token~0)) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse5 .cse15 (not (<= ~token~0 .cse18)) .cse16 .cse17)))) [2019-10-02 16:21:02,606 INFO L443 ceAbstractionStarter]: For program point fire_time_eventsFINAL(lines 451 459) no Hoare annotation was computed. [2019-10-02 16:21:02,606 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-10-02 16:21:02,606 INFO L439 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |old(~T2_E~0)| ~T2_E~0) (= |old(~t1_st~0)| ~t1_st~0) (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_M~0 |old(~E_M~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~token~0)| ~token~0)) [2019-10-02 16:21:02,606 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-02 16:21:02,606 INFO L446 ceAbstractionStarter]: At program point L524(lines 513 526) the Hoare annotation is: true [2019-10-02 16:21:02,606 INFO L443 ceAbstractionStarter]: For program point stop_simulationEXIT(lines 509 527) no Hoare annotation was computed. [2019-10-02 16:21:02,607 INFO L443 ceAbstractionStarter]: For program point L517(lines 517 522) no Hoare annotation was computed. [2019-10-02 16:21:02,607 INFO L446 ceAbstractionStarter]: At program point stop_simulationENTRY(lines 509 527) the Hoare annotation is: true [2019-10-02 16:21:02,607 INFO L446 ceAbstractionStarter]: At program point L515(line 515) the Hoare annotation is: true [2019-10-02 16:21:02,607 INFO L443 ceAbstractionStarter]: For program point L515-1(line 515) no Hoare annotation was computed. [2019-10-02 16:21:02,607 INFO L443 ceAbstractionStarter]: For program point stop_simulationFINAL(lines 509 527) no Hoare annotation was computed. [2019-10-02 16:21:02,607 INFO L439 ceAbstractionStarter]: At program point L287(line 287) the Hoare annotation is: (let ((.cse0 (= ~T1_E~0 0)) (.cse4 (= ~T2_E~0 0))) (let ((.cse36 (= 1 |old(~m_pc~0)|)) (.cse34 (<= 2 ~t2_st~0)) (.cse20 (= 1 ~t1_pc~0)) (.cse24 (not (= 1 ~E_2~0))) (.cse40 (= ~m_pc~0 1)) (.cse37 (= 1 ~t2_pc~0)) (.cse25 (and (and (not .cse0) (not .cse4) (not (= ~E_1~0 0)) (not (= ~E_M~0 0))) (not (= ~E_2~0 0)))) (.cse38 (not (= ~E_M~0 1))) (.cse39 (not (= ~E_1~0 1))) (.cse22 (<= 2 ~t1_st~0)) (.cse29 (= eval_~tmp~0 1))) (let ((.cse17 (let ((.cse41 (+ ~local~0 2))) (and (<= .cse41 ~token~0) (and .cse34 .cse20 (and .cse24 (and (and .cse40 .cse37 .cse25 .cse38) .cse39)) .cse22 .cse29) (<= ~token~0 .cse41)))) (.cse1 (= ~T2_E~0 1)) (.cse2 (not (= |old(~t1_pc~0)| 1))) (.cse3 (not (<= 2 |old(~m_st~0)|))) (.cse5 (= 1 ~M_E~0)) (.cse6 (= 1 |old(~E_M~0)|)) (.cse7 (not (<= 2 |old(~t1_st~0)|))) (.cse8 (not (= ~m_i~0 1))) (.cse19 (= 1 |old(~t2_pc~0)|)) (.cse9 (= 1 |old(~E_1~0)|)) (.cse10 (= 1 |old(~E_2~0)|)) (.cse11 (not .cse36)) (.cse12 (= 0 |old(~E_1~0)|)) (.cse13 (not (= 1 ~t1_i~0))) (.cse14 (not (= 1 ~t2_i~0))) (.cse15 (= 0 |old(~E_M~0)|)) (.cse16 (= 0 |old(~E_2~0)|))) (and (or .cse0 (not (<= 2 |old(~t2_st~0)|)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (let ((.cse18 (+ |old(~local~0)| 1))) (or .cse0 .cse17 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (<= .cse18 |old(~token~0)|)) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (not (<= |old(~token~0)| .cse18)) .cse15 .cse16)) (let ((.cse26 (not .cse40)) (.cse27 (= ~E_1~0 |old(~E_1~0)|))) (let ((.cse23 (not (= ~t2_pc~0 1))) (.cse28 (= ~E_M~0 |old(~E_M~0)|)) (.cse32 (<= ~t1_pc~0 0)) (.cse33 (= 0 ~t1_st~0)) (.cse35 (and .cse24 (and (not (= 1 ~T2_E~0)) .cse37 (= 1 ~m_i~0) .cse25 (= ~t1_i~0 1) (not .cse5) .cse26 .cse38) .cse27 .cse39)) (.cse21 (<= ~token~0 ~local~0)) (.cse30 (<= ~local~0 ~token~0)) (.cse31 (= |old(~token~0)| ~token~0))) (or .cse0 .cse17 .cse1 (not (<= |old(~token~0)| |old(~local~0)|)) .cse4 .cse5 (not (= |old(~t1_st~0)| 0)) .cse19 .cse9 .cse10 .cse13 .cse16 (and .cse20 .cse21 .cse22 (and .cse23 .cse24 .cse25 .cse26 .cse27 .cse28) .cse29 .cse30 .cse31) (and .cse32 (and .cse23 .cse24 .cse25 .cse33 .cse26 .cse27 .cse28) .cse29) (not (<= |old(~local~0)| |old(~token~0)|)) .cse6 (not (= 0 |old(~m_st~0)|)) (and .cse34 .cse35 .cse32 .cse33 .cse29) .cse8 .cse12 (and .cse34 .cse35 .cse20 .cse21 .cse22 .cse29 .cse30 .cse31) .cse14 .cse15 (not (<= |old(~t1_pc~0)| 0)) .cse36))) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse19 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16))))) [2019-10-02 16:21:02,608 INFO L443 ceAbstractionStarter]: For program point L312(lines 312 319) no Hoare annotation was computed. [2019-10-02 16:21:02,608 INFO L443 ceAbstractionStarter]: For program point evalEXIT(lines 265 329) no Hoare annotation was computed. [2019-10-02 16:21:02,608 INFO L443 ceAbstractionStarter]: For program point L284(lines 284 291) no Hoare annotation was computed. [2019-10-02 16:21:02,609 INFO L439 ceAbstractionStarter]: At program point L309(lines 271 323) the Hoare annotation is: (let ((.cse9 (= 1 ~M_E~0)) (.cse0 (= ~T1_E~0 0)) (.cse2 (= ~T2_E~0 0))) (let ((.cse47 (= ~m_pc~0 1)) (.cse35 (not (= 1 ~T2_E~0))) (.cse36 (= 1 ~t2_pc~0)) (.cse37 (= 1 ~m_i~0)) (.cse48 (<= 2 ~m_st~0)) (.cse38 (and (and (not .cse0) (not .cse2) (not (= ~E_1~0 0)) (not (= ~E_M~0 0))) (not (= ~E_2~0 0)))) (.cse39 (= ~t1_i~0 1)) (.cse40 (not .cse9)) (.cse42 (not (= ~E_M~0 1)))) (let ((.cse34 (not (= 1 ~E_2~0))) (.cse65 (and .cse47 .cse35 .cse36 .cse37 .cse48 .cse38 .cse39 .cse40 .cse42)) (.cse44 (not (= ~E_1~0 1)))) (let ((.cse17 (<= 2 ~t2_st~0)) (.cse18 (= 1 ~t1_pc~0)) (.cse62 (and .cse34 .cse65 .cse44)) (.cse20 (not (= eval_~tmp~0 0))) (.cse64 (+ ~local~0 1)) (.cse43 (= ~E_1~0 |old(~E_1~0)|))) (let ((.cse51 (= |old(~t1_st~0)| ~t1_st~0)) (.cse58 (and .cse34 .cse65 .cse43 .cse44)) (.cse33 (= 1 |old(~m_pc~0)|)) (.cse11 (= 1 |old(~t2_pc~0)|)) (.cse61 (= ~t2_i~0 1)) (.cse56 (<= ~token~0 .cse64)) (.cse57 (<= .cse64 ~token~0)) (.cse26 (= ~m_st~0 0)) (.cse60 (and .cse17 .cse18 .cse62 .cse20)) (.cse4 (<= 2 ~t1_st~0))) (let ((.cse45 (not (= ~t2_pc~0 1))) (.cse46 (= ~E_M~0 |old(~E_M~0)|)) (.cse10 (and .cse60 .cse4)) (.cse24 (let ((.cse63 (+ ~local~0 2))) (and (and (and .cse17 .cse18 .cse26 (and .cse34 (and .cse47 .cse35 .cse36 .cse38 .cse39 .cse40 .cse42) .cse44) .cse20) .cse4) (<= .cse63 ~token~0) (<= ~token~0 .cse63)))) (.cse23 (= |old(~token~0)| ~token~0)) (.cse16 (<= ~token~0 ~local~0)) (.cse6 (= 0 ~t1_st~0)) (.cse21 (<= ~local~0 ~token~0)) (.cse32 (and (and .cse62 .cse61 .cse20) .cse18 .cse56 .cse57 .cse4)) (.cse1 (= ~T2_E~0 1)) (.cse49 (not (= |old(~t1_pc~0)| 1))) (.cse50 (not (<= 2 |old(~m_st~0)|))) (.cse27 (= 1 |old(~E_M~0)|)) (.cse59 (not .cse11)) (.cse52 (not (<= 2 |old(~t1_st~0)|))) (.cse28 (not (= ~m_i~0 1))) (.cse12 (= 1 |old(~E_1~0)|)) (.cse13 (= 1 |old(~E_2~0)|)) (.cse53 (not .cse33)) (.cse29 (= 0 |old(~E_1~0)|)) (.cse14 (not (= 1 ~t1_i~0))) (.cse30 (not (= 1 ~t2_i~0))) (.cse31 (= 0 |old(~E_M~0)|)) (.cse15 (= 0 |old(~E_2~0)|)) (.cse54 (and .cse51 .cse4 (and .cse17 .cse18 .cse58 .cse61)))) (and (let ((.cse41 (not .cse47)) (.cse8 (and .cse45 .cse47 .cse34 .cse48 .cse38 .cse39 .cse44 .cse35 .cse40 .cse46))) (let ((.cse19 (and .cse34 (and .cse47 .cse35 .cse36 .cse48 .cse38 .cse39 .cse6 .cse40 .cse42) .cse44)) (.cse3 (and .cse18 .cse20 .cse8)) (.cse22 (and .cse45 .cse34 .cse26 .cse38 .cse39 .cse44 .cse41 .cse35 .cse43 .cse40 .cse46)) (.cse25 (and .cse34 (and .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42) .cse43 .cse44)) (.cse5 (<= ~t1_pc~0 0)) (.cse7 (= eval_~tmp~0 1))) (or .cse0 .cse1 (not (<= |old(~token~0)| |old(~local~0)|)) .cse2 (and .cse3 .cse4) (and .cse5 .cse6 .cse7 .cse8) .cse9 (not (= |old(~t1_st~0)| 0)) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (and .cse16 (and .cse17 .cse18 .cse19 .cse20) .cse21) (and .cse17 .cse5 .cse19 .cse7) (and .cse5 .cse16 .cse6 .cse22 .cse21 .cse23) .cse24 (not (<= |old(~local~0)| |old(~token~0)|)) (and .cse16 .cse3 .cse6 .cse21) (and .cse18 .cse16 .cse4 .cse22 .cse7 .cse21 .cse23) (and .cse17 .cse25 .cse18 .cse26 .cse16 .cse4 .cse7 .cse21 .cse23) .cse27 (not (= 0 |old(~m_st~0)|)) .cse28 (and .cse17 .cse25 .cse5 .cse26 .cse16 .cse6 .cse7 .cse21 .cse23) .cse29 .cse30 .cse31 (not (<= |old(~t1_pc~0)| 0)) .cse32 .cse33))) (or .cse0 .cse1 .cse49 .cse50 .cse2 (and (and .cse18 (and .cse45 .cse47 .cse34 .cse48 .cse38 .cse43 .cse46)) .cse51) .cse9 .cse27 .cse52 .cse28 .cse11 .cse12 .cse13 .cse53 .cse29 .cse14 .cse30 .cse31 .cse15 .cse54) (let ((.cse55 (+ |old(~local~0)| 1))) (or .cse0 .cse1 .cse50 .cse2 .cse9 .cse52 .cse10 (not (<= .cse55 |old(~token~0)|)) .cse12 .cse13 .cse14 .cse15 .cse24 .cse49 (and .cse56 .cse51 .cse57 (and .cse18 .cse58) .cse23) .cse27 .cse59 .cse28 .cse53 (and .cse16 .cse6 .cse60 .cse21) .cse29 .cse30 (not (<= |old(~token~0)| .cse55)) .cse31 .cse54 .cse32)) (or .cse0 (not (<= 2 |old(~t2_st~0)|)) .cse1 .cse49 .cse50 .cse2 .cse9 .cse27 .cse59 .cse52 .cse28 .cse12 .cse13 .cse53 .cse29 .cse14 .cse30 .cse31 .cse15 .cse54)))))))) [2019-10-02 16:21:02,609 INFO L443 ceAbstractionStarter]: For program point L276(lines 276 280) no Hoare annotation was computed. [2019-10-02 16:21:02,609 INFO L443 ceAbstractionStarter]: For program point L276-1(lines 271 323) no Hoare annotation was computed. [2019-10-02 16:21:02,609 INFO L439 ceAbstractionStarter]: At program point L272(line 272) the Hoare annotation is: (let ((.cse9 (= 1 ~M_E~0)) (.cse0 (= ~T1_E~0 0)) (.cse2 (= ~T2_E~0 0))) (let ((.cse47 (= ~m_pc~0 1)) (.cse35 (not (= 1 ~T2_E~0))) (.cse36 (= 1 ~t2_pc~0)) (.cse37 (= 1 ~m_i~0)) (.cse48 (<= 2 ~m_st~0)) (.cse38 (and (and (not .cse0) (not .cse2) (not (= ~E_1~0 0)) (not (= ~E_M~0 0))) (not (= ~E_2~0 0)))) (.cse39 (= ~t1_i~0 1)) (.cse40 (not .cse9)) (.cse42 (not (= ~E_M~0 1)))) (let ((.cse34 (not (= 1 ~E_2~0))) (.cse65 (and .cse47 .cse35 .cse36 .cse37 .cse48 .cse38 .cse39 .cse40 .cse42)) (.cse44 (not (= ~E_1~0 1)))) (let ((.cse17 (<= 2 ~t2_st~0)) (.cse18 (= 1 ~t1_pc~0)) (.cse62 (and .cse34 .cse65 .cse44)) (.cse20 (not (= eval_~tmp~0 0))) (.cse64 (+ ~local~0 1)) (.cse43 (= ~E_1~0 |old(~E_1~0)|))) (let ((.cse51 (= |old(~t1_st~0)| ~t1_st~0)) (.cse58 (and .cse34 .cse65 .cse43 .cse44)) (.cse33 (= 1 |old(~m_pc~0)|)) (.cse11 (= 1 |old(~t2_pc~0)|)) (.cse61 (= ~t2_i~0 1)) (.cse56 (<= ~token~0 .cse64)) (.cse57 (<= .cse64 ~token~0)) (.cse26 (= ~m_st~0 0)) (.cse60 (and .cse17 .cse18 .cse62 .cse20)) (.cse4 (<= 2 ~t1_st~0))) (let ((.cse45 (not (= ~t2_pc~0 1))) (.cse46 (= ~E_M~0 |old(~E_M~0)|)) (.cse10 (and .cse60 .cse4)) (.cse24 (let ((.cse63 (+ ~local~0 2))) (and (and (and .cse17 .cse18 .cse26 (and .cse34 (and .cse47 .cse35 .cse36 .cse38 .cse39 .cse40 .cse42) .cse44) .cse20) .cse4) (<= .cse63 ~token~0) (<= ~token~0 .cse63)))) (.cse23 (= |old(~token~0)| ~token~0)) (.cse16 (<= ~token~0 ~local~0)) (.cse6 (= 0 ~t1_st~0)) (.cse21 (<= ~local~0 ~token~0)) (.cse32 (and (and .cse62 .cse61 .cse20) .cse18 .cse56 .cse57 .cse4)) (.cse1 (= ~T2_E~0 1)) (.cse49 (not (= |old(~t1_pc~0)| 1))) (.cse50 (not (<= 2 |old(~m_st~0)|))) (.cse27 (= 1 |old(~E_M~0)|)) (.cse59 (not .cse11)) (.cse52 (not (<= 2 |old(~t1_st~0)|))) (.cse28 (not (= ~m_i~0 1))) (.cse12 (= 1 |old(~E_1~0)|)) (.cse13 (= 1 |old(~E_2~0)|)) (.cse53 (not .cse33)) (.cse29 (= 0 |old(~E_1~0)|)) (.cse14 (not (= 1 ~t1_i~0))) (.cse30 (not (= 1 ~t2_i~0))) (.cse31 (= 0 |old(~E_M~0)|)) (.cse15 (= 0 |old(~E_2~0)|)) (.cse54 (and .cse51 .cse4 (and .cse17 .cse18 .cse58 .cse61)))) (and (let ((.cse41 (not .cse47)) (.cse8 (and .cse45 .cse47 .cse34 .cse48 .cse38 .cse39 .cse44 .cse35 .cse40 .cse46))) (let ((.cse19 (and .cse34 (and .cse47 .cse35 .cse36 .cse48 .cse38 .cse39 .cse6 .cse40 .cse42) .cse44)) (.cse3 (and .cse18 .cse20 .cse8)) (.cse22 (and .cse45 .cse34 .cse26 .cse38 .cse39 .cse44 .cse41 .cse35 .cse43 .cse40 .cse46)) (.cse25 (and .cse34 (and .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42) .cse43 .cse44)) (.cse5 (<= ~t1_pc~0 0)) (.cse7 (= eval_~tmp~0 1))) (or .cse0 .cse1 (not (<= |old(~token~0)| |old(~local~0)|)) .cse2 (and .cse3 .cse4) (and .cse5 .cse6 .cse7 .cse8) .cse9 (not (= |old(~t1_st~0)| 0)) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (and .cse16 (and .cse17 .cse18 .cse19 .cse20) .cse21) (and .cse17 .cse5 .cse19 .cse7) (and .cse5 .cse16 .cse6 .cse22 .cse21 .cse23) .cse24 (not (<= |old(~local~0)| |old(~token~0)|)) (and .cse16 .cse3 .cse6 .cse21) (and .cse18 .cse16 .cse4 .cse22 .cse7 .cse21 .cse23) (and .cse17 .cse25 .cse18 .cse26 .cse16 .cse4 .cse7 .cse21 .cse23) .cse27 (not (= 0 |old(~m_st~0)|)) .cse28 (and .cse17 .cse25 .cse5 .cse26 .cse16 .cse6 .cse7 .cse21 .cse23) .cse29 .cse30 .cse31 (not (<= |old(~t1_pc~0)| 0)) .cse32 .cse33))) (or .cse0 .cse1 .cse49 .cse50 .cse2 (and (and .cse18 (and .cse45 .cse47 .cse34 .cse48 .cse38 .cse43 .cse46)) .cse51) .cse9 .cse27 .cse52 .cse28 .cse11 .cse12 .cse13 .cse53 .cse29 .cse14 .cse30 .cse31 .cse15 .cse54) (let ((.cse55 (+ |old(~local~0)| 1))) (or .cse0 .cse1 .cse50 .cse2 .cse9 .cse52 .cse10 (not (<= .cse55 |old(~token~0)|)) .cse12 .cse13 .cse14 .cse15 .cse24 .cse49 (and .cse56 .cse51 .cse57 (and .cse18 .cse58) .cse23) .cse27 .cse59 .cse28 .cse53 (and .cse16 .cse6 .cse60 .cse21) .cse29 .cse30 (not (<= |old(~token~0)| .cse55)) .cse31 .cse54 .cse32)) (or .cse0 (not (<= 2 |old(~t2_st~0)|)) .cse1 .cse49 .cse50 .cse2 .cse9 .cse27 .cse59 .cse52 .cse28 .cse12 .cse13 .cse53 .cse29 .cse14 .cse30 .cse31 .cse15 .cse54)))))))) [2019-10-02 16:21:02,610 INFO L439 ceAbstractionStarter]: At program point L301(line 301) the Hoare annotation is: (let ((.cse5 (= 1 ~M_E~0)) (.cse0 (= ~T1_E~0 0)) (.cse4 (= ~T2_E~0 0))) (let ((.cse18 (not (= 1 ~E_2~0))) (.cse41 (= ~m_pc~0 1)) (.cse45 (not (= 1 ~T2_E~0))) (.cse19 (= 1 ~t2_pc~0)) (.cse42 (<= 2 ~m_st~0)) (.cse20 (and (and (not .cse0) (not .cse4) (not (= ~E_1~0 0)) (not (= ~E_M~0 0))) (not (= ~E_2~0 0)))) (.cse43 (= ~t1_i~0 1)) (.cse46 (not .cse5)) (.cse22 (not (= ~E_M~0 1))) (.cse44 (not (= ~E_1~0 1)))) (let ((.cse40 (= 1 |old(~m_pc~0)|)) (.cse17 (<= 2 ~t2_st~0)) (.cse34 (= 1 ~t1_pc~0)) (.cse39 (and .cse18 (and .cse41 .cse45 .cse19 (= 1 ~m_i~0) .cse42 .cse20 .cse43 .cse46 .cse22) .cse44)) (.cse35 (not (= eval_~tmp~0 0))) (.cse25 (not (= 0 ~t1_st~0))) (.cse27 (<= ~token~0 ~local~0)) (.cse30 (<= ~local~0 ~token~0))) (let ((.cse32 (= 1 |old(~t2_pc~0)|)) (.cse1 (= ~T2_E~0 1)) (.cse2 (not (= |old(~t1_pc~0)| 1))) (.cse3 (not (<= 2 |old(~m_st~0)|))) (.cse6 (= 1 |old(~E_M~0)|)) (.cse7 (not (<= 2 |old(~t1_st~0)|))) (.cse8 (not (= ~m_i~0 1))) (.cse9 (= 1 |old(~E_1~0)|)) (.cse33 (and (and .cse17 .cse34 .cse39 .cse35) .cse25 .cse27 .cse30)) (.cse10 (= 1 |old(~E_2~0)|)) (.cse11 (not .cse40)) (.cse12 (= 0 |old(~E_1~0)|)) (.cse13 (not (= 1 ~t1_i~0))) (.cse14 (not (= 1 ~t2_i~0))) (.cse15 (= 0 |old(~E_M~0)|)) (.cse16 (= 0 |old(~E_2~0)|))) (and (or .cse0 (not (<= 2 |old(~t2_st~0)|)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (let ((.cse37 (not (= ~t2_pc~0 1))) (.cse38 (= ~E_M~0 |old(~E_M~0)|))) (let ((.cse26 (= ~m_st~0 0)) (.cse21 (not .cse41)) (.cse23 (= ~E_1~0 |old(~E_1~0)|)) (.cse31 (= |old(~token~0)| ~token~0)) (.cse36 (and .cse37 .cse41 .cse18 .cse42 .cse20 .cse43 .cse44 .cse45 .cse46 .cse38)) (.cse24 (<= ~t1_pc~0 0)) (.cse28 (= eval_~tmp~0 1)) (.cse29 (<= |old(~t1_st~0)| ~t1_st~0))) (or (and .cse17 (and .cse18 (and .cse19 .cse20 .cse21 .cse22) .cse23) .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31) .cse0 .cse1 (not (<= |old(~token~0)| |old(~local~0)|)) .cse4 .cse5 (not (= |old(~t1_st~0)| 0)) .cse32 .cse9 .cse33 (and .cse25 (and .cse34 .cse35 .cse36)) .cse10 (and .cse24 .cse25 .cse27 (and .cse37 .cse18 .cse26 .cse20 .cse21 .cse23 .cse38) .cse28 .cse29 .cse30 .cse31) .cse13 (and .cse24 .cse25 .cse28 .cse29 .cse36) .cse16 (not (<= |old(~local~0)| |old(~token~0)|)) .cse6 (not (= 0 |old(~m_st~0)|)) .cse8 .cse12 (and .cse17 .cse24 .cse25 .cse39 .cse28 .cse29) .cse14 .cse15 (not (<= |old(~t1_pc~0)| 0)) .cse40))) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse32 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (let ((.cse47 (+ |old(~local~0)| 1))) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (<= .cse47 |old(~token~0)|)) .cse8 .cse9 .cse33 .cse10 .cse11 .cse12 .cse13 .cse14 (not (<= |old(~token~0)| .cse47)) .cse15 .cse16))))))) [2019-10-02 16:21:02,610 INFO L439 ceAbstractionStarter]: At program point evalENTRY(lines 265 329) the Hoare annotation is: (let ((.cse29 (= 1 |old(~m_pc~0)|)) (.cse17 (= 1 |old(~t2_pc~0)|))) (let ((.cse1 (not (= ~t2_pc~0 1))) (.cse0 (= ~T1_E~0 0)) (.cse9 (= ~T2_E~0 1)) (.cse10 (not (= |old(~t1_pc~0)| 1))) (.cse11 (not (<= 2 |old(~m_st~0)|))) (.cse12 (= ~T2_E~0 0)) (.cse13 (= 1 ~M_E~0)) (.cse14 (= 1 |old(~E_M~0)|)) (.cse27 (not .cse17)) (.cse15 (not (<= 2 |old(~t1_st~0)|))) (.cse16 (not (= ~m_i~0 1))) (.cse18 (= 1 |old(~E_1~0)|)) (.cse19 (= 1 |old(~E_2~0)|)) (.cse20 (not .cse29)) (.cse21 (= 0 |old(~E_1~0)|)) (.cse22 (not (= 1 ~t1_i~0))) (.cse2 (= 1 ~t1_pc~0)) (.cse3 (<= 2 ~m_st~0)) (.cse28 (= |old(~token~0)| ~token~0)) (.cse4 (= ~E_1~0 |old(~E_1~0)|)) (.cse5 (= ~E_2~0 |old(~E_2~0)|)) (.cse6 (= ~m_pc~0 1)) (.cse26 (= 1 ~t2_pc~0)) (.cse7 (= |old(~t1_st~0)| ~t1_st~0)) (.cse8 (= ~E_M~0 |old(~E_M~0)|)) (.cse23 (not (= 1 ~t2_i~0))) (.cse24 (= 0 |old(~E_M~0)|)) (.cse25 (= 0 |old(~E_2~0)|))) (and (or .cse0 (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) (or .cse0 (not (<= 2 |old(~t2_st~0)|)) .cse9 .cse10 .cse11 .cse12 (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse26 (<= 2 ~t2_st~0) .cse7 .cse8) .cse13 .cse14 .cse27 .cse15 .cse16 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) (or .cse0 .cse9 (not (<= |old(~token~0)| |old(~local~0)|)) (not (<= |old(~local~0)| |old(~token~0)|)) .cse12 .cse13 (not (= |old(~t1_st~0)| 0)) .cse14 (not (= 0 |old(~m_st~0)|)) .cse16 .cse17 .cse18 .cse19 .cse21 .cse22 .cse23 .cse24 .cse25 (and .cse1 (<= ~t1_pc~0 0) (= ~m_st~0 0) (not .cse6) .cse28 .cse4 (<= ~token~0 ~local~0) .cse5 .cse7 .cse8 (<= ~local~0 ~token~0)) (not (<= |old(~t1_pc~0)| 0)) .cse29) (let ((.cse30 (+ |old(~local~0)| 1))) (or .cse0 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse27 .cse15 (not (<= .cse30 |old(~token~0)|)) .cse16 .cse18 .cse19 .cse20 .cse21 .cse22 (let ((.cse31 (+ ~local~0 1))) (and .cse2 (<= ~token~0 .cse31) .cse3 .cse28 .cse4 .cse5 .cse6 .cse26 .cse7 (<= .cse31 ~token~0) .cse8)) .cse23 (not (<= |old(~token~0)| .cse30)) .cse24 .cse25))))) [2019-10-02 16:21:02,611 INFO L443 ceAbstractionStarter]: For program point L281(lines 271 323) no Hoare annotation was computed. [2019-10-02 16:21:02,611 INFO L443 ceAbstractionStarter]: For program point L298(lines 298 305) no Hoare annotation was computed. [2019-10-02 16:21:02,611 INFO L439 ceAbstractionStarter]: At program point L315(line 315) the Hoare annotation is: (let ((.cse5 (= 1 ~M_E~0)) (.cse0 (= ~T1_E~0 0)) (.cse4 (= ~T2_E~0 0))) (let ((.cse40 (= 1 |old(~m_pc~0)|)) (.cse14 (not (= 1 ~E_2~0))) (.cse13 (= ~m_pc~0 1)) (.cse43 (not (= 1 ~T2_E~0))) (.cse15 (<= 2 ~m_st~0)) (.cse16 (and (and (not .cse0) (not .cse4) (not (= ~E_1~0 0)) (not (= ~E_M~0 0))) (not (= ~E_2~0 0)))) (.cse41 (= ~t1_i~0 1)) (.cse44 (not .cse5)) (.cse42 (not (= ~E_1~0 1))) (.cse19 (not (= eval_~tmp~0 0))) (.cse11 (= 1 ~t1_pc~0)) (.cse29 (<= 2 ~t1_st~0)) (.cse9 (= 1 |old(~t2_pc~0)|))) (let ((.cse17 (= ~E_1~0 |old(~E_1~0)|)) (.cse12 (not (= ~t2_pc~0 1))) (.cse18 (= ~E_M~0 |old(~E_M~0)|)) (.cse1 (= ~T2_E~0 1)) (.cse2 (not (= |old(~t1_pc~0)| 1))) (.cse3 (not (<= 2 |old(~m_st~0)|))) (.cse6 (= 1 |old(~E_M~0)|)) (.cse27 (not .cse9)) (.cse7 (not (<= 2 |old(~t1_st~0)|))) (.cse8 (not (= ~m_i~0 1))) (.cse10 (= 1 |old(~E_1~0)|)) (.cse39 (let ((.cse46 (+ ~local~0 1))) (and (and (and (and .cse14 (and .cse13 .cse43 (= 1 ~t2_pc~0) (= 1 ~m_i~0) .cse15 .cse16 .cse41 .cse44 (not (= ~E_M~0 1))) .cse42) .cse19) .cse11 .cse29) (<= ~token~0 .cse46) (<= .cse46 ~token~0)))) (.cse20 (= 1 |old(~E_2~0)|)) (.cse21 (not .cse40)) (.cse22 (= 0 |old(~E_1~0)|)) (.cse23 (not (= 1 ~t1_i~0))) (.cse24 (not (= 1 ~t2_i~0))) (.cse25 (= 0 |old(~E_M~0)|)) (.cse26 (= 0 |old(~E_2~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (and (= |old(~t1_st~0)| ~t1_st~0) (and .cse11 (and .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) .cse19)) .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26) (or .cse0 (not (<= 2 |old(~t2_st~0)|)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse27 .cse7 .cse8 .cse10 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26) (let ((.cse33 (and .cse12 .cse13 .cse14 .cse15 .cse16 .cse41 .cse42 .cse43 .cse44 .cse18))) (let ((.cse30 (<= ~t1_pc~0 0)) (.cse28 (and .cse11 .cse19 .cse33)) (.cse31 (= 0 ~t1_st~0)) (.cse34 (= ~m_st~0 0)) (.cse35 (<= ~token~0 ~local~0)) (.cse36 (not .cse13)) (.cse32 (= eval_~tmp~0 1)) (.cse37 (<= ~local~0 ~token~0)) (.cse38 (= |old(~token~0)| ~token~0))) (or .cse0 .cse1 (not (<= |old(~token~0)| |old(~local~0)|)) .cse4 (and .cse28 .cse29) (and .cse30 .cse31 .cse32 .cse33) .cse5 (not (= |old(~t1_st~0)| 0)) .cse9 .cse10 .cse20 .cse23 .cse26 (and .cse30 .cse34 .cse35 (and .cse12 .cse14 .cse16 .cse31 .cse36 .cse17 .cse18) .cse32 .cse37 .cse38) (not (<= |old(~local~0)| |old(~token~0)|)) (and .cse35 .cse28 .cse31 .cse37) (and .cse11 .cse34 .cse35 .cse29 (and .cse12 .cse14 .cse16 .cse36 .cse17 .cse18) .cse32 .cse37 .cse38) .cse6 (not (= 0 |old(~m_st~0)|)) .cse8 .cse39 .cse22 .cse24 .cse25 (not (<= |old(~t1_pc~0)| 0)) .cse40))) (let ((.cse45 (+ |old(~local~0)| 1))) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse27 .cse7 (not (<= .cse45 |old(~token~0)|)) .cse8 .cse10 .cse39 .cse20 .cse21 .cse22 .cse23 .cse24 (not (<= |old(~token~0)| .cse45)) .cse25 .cse26)))))) [2019-10-02 16:21:02,611 INFO L443 ceAbstractionStarter]: For program point L274(line 274) no Hoare annotation was computed. [2019-10-02 16:21:02,612 INFO L443 ceAbstractionStarter]: For program point L295(lines 271 323) no Hoare annotation was computed. [2019-10-02 16:21:02,612 INFO L439 ceAbstractionStarter]: At program point L324(lines 265 329) the Hoare annotation is: (let ((.cse0 (= ~T1_E~0 0)) (.cse3 (= ~T2_E~0 0))) (let ((.cse24 (= ~m_pc~0 1)) (.cse26 (<= 2 ~m_st~0)) (.cse27 (and (and (not .cse0) (not .cse3) (not (= ~E_1~0 0)) (not (= ~E_M~0 0))) (not (= ~E_2~0 0)))) (.cse4 (= 1 ~M_E~0))) (let ((.cse25 (not (= 1 ~E_2~0))) (.cse36 (and .cse24 (not (= 1 ~T2_E~0)) (= 1 ~t2_pc~0) .cse26 .cse27 (= ~t1_i~0 1) (not .cse4) (not (= ~E_M~0 1)))) (.cse28 (not (= ~E_1~0 1)))) (let ((.cse31 (= 1 |old(~m_pc~0)|)) (.cse33 (= |old(~t1_st~0)| ~t1_st~0)) (.cse34 (= ~E_1~0 |old(~E_1~0)|)) (.cse30 (= 1 |old(~t2_pc~0)|)) (.cse35 (<= 2 ~t2_st~0)) (.cse21 (= 1 ~t1_pc~0)) (.cse37 (and .cse25 .cse36 .cse28)) (.cse22 (<= 2 ~t1_st~0))) (let ((.cse11 (let ((.cse38 (+ ~local~0 1))) (and .cse21 (<= ~token~0 .cse38) .cse37 (<= .cse38 ~token~0) .cse22))) (.cse13 (and .cse35 .cse21 .cse37 .cse22)) (.cse15 (not .cse30)) (.cse32 (and .cse35 .cse21 .cse33 (and .cse25 .cse36 .cse34))) (.cse1 (= ~T2_E~0 1)) (.cse12 (not (= |old(~t1_pc~0)| 1))) (.cse2 (not (<= 2 |old(~m_st~0)|))) (.cse14 (= 1 |old(~E_M~0)|)) (.cse5 (not (<= 2 |old(~t1_st~0)|))) (.cse16 (not (= ~m_i~0 1))) (.cse7 (= 1 |old(~E_1~0)|)) (.cse23 (not (= ~t2_pc~0 1))) (.cse29 (= ~E_M~0 |old(~E_M~0)|)) (.cse8 (= 1 |old(~E_2~0)|)) (.cse17 (not .cse31)) (.cse18 (= 0 |old(~E_1~0)|)) (.cse9 (not (= 1 ~t1_i~0))) (.cse19 (not (= 1 ~t2_i~0))) (.cse20 (= 0 |old(~E_M~0)|)) (.cse10 (= 0 |old(~E_2~0)|))) (and (let ((.cse6 (+ |old(~local~0)| 1))) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (<= .cse6 |old(~token~0)|)) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 (not (<= |old(~token~0)| .cse6)) .cse20)) (or .cse0 .cse1 .cse11 (not (<= |old(~token~0)| |old(~local~0)|)) (not (<= |old(~local~0)| |old(~token~0)|)) .cse13 .cse3 .cse4 (not (= |old(~t1_st~0)| 0)) .cse14 (and .cse21 .cse22 (and .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29)) (not (= 0 |old(~m_st~0)|)) .cse16 .cse30 .cse7 .cse8 .cse18 .cse9 .cse19 .cse20 .cse10 (not (<= |old(~t1_pc~0)| 0)) .cse31) (or .cse32 .cse0 (not (<= 2 |old(~t2_st~0)|)) .cse1 .cse12 .cse2 .cse3 .cse4 .cse14 .cse15 .cse5 .cse16 .cse7 .cse8 .cse17 .cse18 .cse9 .cse19 .cse20 .cse10) (or .cse32 .cse0 .cse1 .cse12 .cse2 .cse3 .cse4 .cse14 .cse5 .cse16 .cse30 .cse7 (and .cse21 .cse33 (and .cse23 .cse24 .cse25 .cse26 .cse27 .cse34 .cse29)) .cse8 .cse17 .cse18 .cse9 .cse19 .cse20 .cse10))))))) [2019-10-02 16:21:02,612 INFO L443 ceAbstractionStarter]: For program point L194-2(lines 194 203) no Hoare annotation was computed. [2019-10-02 16:21:02,612 INFO L443 ceAbstractionStarter]: For program point is_transmit2_triggeredFINAL(lines 190 208) no Hoare annotation was computed. [2019-10-02 16:21:02,613 INFO L439 ceAbstractionStarter]: At program point L205(lines 193 207) the Hoare annotation is: (let ((.cse13 (= 1 ~m_pc~0)) (.cse33 (+ ~local~0 1)) (.cse32 (= ~t1_st~0 0)) (.cse20 (= 1 ~E_1~0)) (.cse8 (= 1 ~t2_pc~0)) (.cse6 (= 1 ~E_M~0))) (let ((.cse15 (not (<= ~t1_pc~0 0))) (.cse28 (not .cse6)) (.cse19 (not (= 0 ~m_st~0))) (.cse26 (not (<= 2 ~t2_st~0))) (.cse17 (not (<= ~token~0 ~local~0))) (.cse18 (not (<= ~local~0 ~token~0))) (.cse5 (= 1 ~M_E~0)) (.cse27 (not .cse8)) (.cse0 (not .cse20)) (.cse16 (not .cse32)) (.cse1 (= is_transmit2_triggered_~__retres1~2 0)) (.cse2 (= ~T1_E~0 0)) (.cse3 (= ~T2_E~0 1)) (.cse22 (not (= ~t1_pc~0 1))) (.cse23 (not (<= 2 ~m_st~0))) (.cse4 (= ~T2_E~0 0)) (.cse24 (not (<= 2 ~t1_st~0))) (.cse30 (not (<= .cse33 ~token~0))) (.cse7 (not (= ~m_i~0 1))) (.cse9 (= 1 ~E_2~0)) (.cse25 (not .cse13)) (.cse21 (= 0 ~E_1~0)) (.cse10 (not (= 1 ~t1_i~0))) (.cse14 (not (= 1 ~t2_i~0))) (.cse31 (not (<= ~token~0 .cse33))) (.cse11 (= 0 ~E_M~0)) (.cse12 (= 0 ~E_2~0))) (and (or .cse0 .cse1 (or .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) .cse14 .cse15 .cse16) (or .cse1 .cse2 .cse3 .cse17 .cse18 .cse4 .cse16 .cse6 .cse19 .cse7 .cse8 .cse20 .cse9 .cse21 .cse10 .cse14 .cse11 .cse12 .cse15 .cse13) (or .cse2 .cse3 .cse22 .cse23 .cse4 .cse6 .cse24 .cse7 .cse8 .cse20 .cse9 .cse25 .cse21 .cse1 .cse10 .cse14 .cse11 .cse12) (or .cse0 .cse1 .cse26 (or .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13) .cse14 .cse15 .cse16) (or .cse0 .cse24 .cse26 (or .cse9 (or .cse6 .cse27 .cse2 .cse7 .cse3 .cse10 .cse11 .cse12 .cse4 .cse5)) .cse22 .cse1 .cse14) (or .cse28 .cse2 .cse3 .cse22 .cse23 .cse4 .cse5 .cse27 .cse24 .cse7 .cse20 .cse9 .cse25 .cse21 .cse10 .cse1 .cse14 .cse12) (or .cse17 .cse22 .cse18 .cse1 (or .cse2 .cse3 .cse4 .cse5 .cse6 .cse0 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) .cse14 .cse16) (let ((.cse29 (+ ~local~0 2))) (or .cse28 .cse2 .cse3 (not (<= ~token~0 .cse29)) .cse22 .cse4 .cse5 .cse27 .cse1 .cse24 .cse19 .cse7 .cse20 .cse9 .cse25 .cse21 .cse10 .cse14 .cse12 (not (<= .cse29 ~token~0)))) (or .cse2 .cse26 .cse3 .cse22 .cse1 .cse23 .cse4 .cse6 .cse24 .cse7 .cse20 .cse9 .cse25 .cse21 .cse10 .cse14 .cse11 .cse12) (or .cse0 .cse24 (or .cse9 (or .cse6 .cse2 .cse8 .cse7 .cse3 .cse10 .cse11 .cse12 .cse4 .cse13 .cse5)) .cse22 .cse14 .cse1) (or .cse2 .cse26 .cse3 .cse22 .cse23 .cse4 .cse5 .cse6 .cse1 .cse30 .cse7 .cse20 .cse25 .cse21 .cse10 .cse14 .cse31 .cse11 .cse12 .cse9 .cse32) (or .cse2 .cse3 .cse22 .cse23 .cse4 .cse5 .cse6 .cse7 .cse8 .cse20 .cse25 .cse21 .cse10 .cse1 .cse14 .cse11 .cse12 .cse32) (or .cse26 .cse17 .cse22 .cse18 .cse1 (or .cse2 .cse3 .cse4 .cse5 .cse6 .cse27 .cse0 .cse7 .cse9 .cse10 .cse11 .cse12) .cse14 .cse16) (or .cse1 .cse2 .cse3 .cse22 .cse23 .cse4 .cse6 .cse24 .cse30 .cse7 .cse20 .cse9 .cse25 .cse21 .cse10 .cse14 .cse31 .cse11 .cse12)))) [2019-10-02 16:21:02,613 INFO L446 ceAbstractionStarter]: At program point is_transmit2_triggeredENTRY(lines 190 208) the Hoare annotation is: true [2019-10-02 16:21:02,613 INFO L443 ceAbstractionStarter]: For program point is_transmit2_triggeredEXIT(lines 190 208) no Hoare annotation was computed. [2019-10-02 16:21:02,613 INFO L443 ceAbstractionStarter]: For program point L195(lines 195 200) no Hoare annotation was computed. [2019-10-02 16:21:02,613 INFO L443 ceAbstractionStarter]: For program point L194(lines 194 203) no Hoare annotation was computed. [2019-10-02 16:21:02,614 INFO L439 ceAbstractionStarter]: At program point fire_delta_eventsENTRY(lines 330 367) the Hoare annotation is: (let ((.cse15 (= 1 ~m_pc~0))) (let ((.cse0 (= |old(~T1_E~0)| 0)) (.cse14 (and (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|) (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|))) (.cse1 (= |old(~T2_E~0)| 1)) (.cse16 (not (= ~t1_pc~0 1))) (.cse17 (not (<= 2 ~m_st~0))) (.cse2 (= |old(~T2_E~0)| 0)) (.cse3 (= 1 |old(~M_E~0)|)) (.cse4 (= 1 |old(~E_M~0)|)) (.cse18 (not (<= 2 ~t1_st~0))) (.cse5 (not (= ~m_i~0 1))) (.cse6 (= 1 ~t2_pc~0)) (.cse7 (= 1 |old(~E_1~0)|)) (.cse8 (= 1 |old(~E_2~0)|)) (.cse19 (not .cse15)) (.cse9 (= 0 |old(~E_1~0)|)) (.cse10 (not (= 1 ~t1_i~0))) (.cse11 (not (= 1 ~t2_i~0))) (.cse12 (= 0 |old(~E_M~0)|)) (.cse13 (= 0 |old(~E_2~0)|))) (and (or .cse0 .cse1 (not (<= ~token~0 ~local~0)) (not (<= ~local~0 ~token~0)) .cse2 .cse3 (not (= ~t1_st~0 0)) .cse4 (not (= 0 ~m_st~0)) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (not (<= ~t1_pc~0 0)) .cse15) (or .cse0 (not (<= 2 ~t2_st~0)) .cse1 .cse16 .cse17 .cse2 .cse14 .cse3 .cse4 .cse18 .cse5 .cse7 .cse8 .cse19 .cse9 .cse10 .cse11 .cse12 .cse13) (let ((.cse20 (+ ~local~0 1))) (or .cse0 .cse1 .cse16 .cse17 .cse2 .cse3 .cse4 .cse18 (not (<= .cse20 ~token~0)) .cse5 .cse7 .cse8 .cse19 .cse9 .cse10 .cse14 .cse11 (not (<= ~token~0 .cse20)) .cse12 .cse13)) (or .cse0 .cse14 .cse1 .cse16 .cse17 .cse2 .cse3 .cse4 .cse18 .cse5 .cse6 .cse7 .cse8 .cse19 .cse9 .cse10 .cse11 .cse12 .cse13)))) [2019-10-02 16:21:02,614 INFO L443 ceAbstractionStarter]: For program point L349-1(lines 333 366) no Hoare annotation was computed. [2019-10-02 16:21:02,614 INFO L443 ceAbstractionStarter]: For program point L339-1(lines 333 366) no Hoare annotation was computed. [2019-10-02 16:21:02,614 INFO L443 ceAbstractionStarter]: For program point L354-1(lines 333 366) no Hoare annotation was computed. [2019-10-02 16:21:02,614 INFO L443 ceAbstractionStarter]: For program point L344-1(lines 333 366) no Hoare annotation was computed. [2019-10-02 16:21:02,614 INFO L443 ceAbstractionStarter]: For program point fire_delta_eventsEXIT(lines 330 367) no Hoare annotation was computed. [2019-10-02 16:21:02,614 INFO L443 ceAbstractionStarter]: For program point L334-1(lines 333 366) no Hoare annotation was computed. [2019-10-02 16:21:02,614 INFO L443 ceAbstractionStarter]: For program point L359-1(lines 330 367) no Hoare annotation was computed. [2019-10-02 16:21:02,615 INFO L443 ceAbstractionStarter]: For program point update_channelsEXIT(lines 209 216) no Hoare annotation was computed. [2019-10-02 16:21:02,615 INFO L446 ceAbstractionStarter]: At program point update_channelsFINAL(lines 209 216) the Hoare annotation is: true [2019-10-02 16:21:02,615 INFO L439 ceAbstractionStarter]: At program point L543-1(lines 540 580) the Hoare annotation is: (let ((.cse5 (not (= 1 ~E_2~0))) (.cse7 (= |old(~T2_E~0)| ~T2_E~0)) (.cse6 (= ~m_pc~0 1)) (.cse10 (not (= ~T1_E~0 0))) (.cse12 (<= 2 ~m_st~0)) (.cse13 (not (= ~E_1~0 0))) (.cse8 (not (= 1 ~M_E~0))) (.cse9 (not (= ~E_2~0 0))) (.cse14 (not (= ~E_1~0 1)))) (let ((.cse4 (not (= ~t2_pc~0 1))) (.cse11 (= ~E_M~0 |old(~E_M~0)|)) (.cse1 (= 1 ~t1_pc~0)) (.cse2 (and .cse5 (and .cse7 (not (= 1 ~T2_E~0)) (and .cse6 .cse10 (= 1 ~t2_pc~0) (not (= ~T2_E~0 0)) .cse12 (= ~t1_i~0 1) .cse13 (not (= ~E_M~0 0)) .cse8 .cse9) (not (= ~E_M~0 1))) .cse14)) (.cse3 (<= 2 ~t1_st~0))) (or (= |old(~T1_E~0)| 0) (= |old(~T2_E~0)| 1) (not (<= |old(~token~0)| |old(~local~0)|)) (let ((.cse0 (+ ~local~0 1))) (and (<= ~token~0 .cse0) (<= .cse0 ~token~0) (and .cse1 .cse2 .cse3))) (= |old(~T2_E~0)| 0) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~t2_pc~0)|) (= 1 |old(~E_1~0)|) (= 1 |old(~E_2~0)|) (not (= 1 ~t1_i~0)) (= 0 |old(~E_2~0)|) (and .cse4 (<= ~t1_pc~0 0) .cse5 (= ~m_st~0 0) (not .cse6) (= |old(~token~0)| ~token~0) .cse7 (= ~E_1~0 |old(~E_1~0)|) (<= ~token~0 ~local~0) .cse8 .cse9 .cse10 (= |old(~t1_st~0)| ~t1_st~0) .cse11 (<= ~local~0 ~token~0)) (and .cse1 (and .cse7 .cse5 (and .cse4 .cse6 .cse10 .cse12 .cse13 .cse8 .cse9) .cse14 .cse11) .cse3) (not (<= |old(~local~0)| |old(~token~0)|)) (= 1 |old(~E_M~0)|) (not (= 0 |old(~m_st~0)|)) (and (<= 2 ~t2_st~0) .cse1 .cse2 .cse3) (not (= ~m_i~0 1)) (= 0 |old(~E_1~0)|) (not (= 1 ~t2_i~0)) (= 0 |old(~E_M~0)|) (not (<= |old(~t1_pc~0)| 0)) (= 1 |old(~m_pc~0)|)))) [2019-10-02 16:21:02,615 INFO L439 ceAbstractionStarter]: At program point L539(line 539) the Hoare annotation is: (or (= |old(~T1_E~0)| 0) (= |old(~T2_E~0)| 1) (not (<= |old(~token~0)| |old(~local~0)|)) (not (<= |old(~local~0)| |old(~token~0)|)) (= |old(~T2_E~0)| 0) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (and (not (= ~t2_pc~0 1)) (<= ~t1_pc~0 0) (= ~m_st~0 0) (not (= ~m_pc~0 1)) (= |old(~token~0)| ~token~0) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (<= ~token~0 ~local~0) (= ~E_2~0 |old(~E_2~0)|) (= |old(~t1_st~0)| ~t1_st~0) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (<= ~local~0 ~token~0)) (= 1 |old(~E_M~0)|) (not (= 0 |old(~m_st~0)|)) (not (= ~m_i~0 1)) (= 1 |old(~t2_pc~0)|) (= 1 |old(~E_1~0)|) (= 1 |old(~E_2~0)|) (= 0 |old(~E_1~0)|) (not (= 1 ~t1_i~0)) (not (= 1 ~t2_i~0)) (= 0 |old(~E_M~0)|) (= 0 |old(~E_2~0)|) (not (<= |old(~t1_pc~0)| 0)) (= 1 |old(~m_pc~0)|)) [2019-10-02 16:21:02,616 INFO L443 ceAbstractionStarter]: For program point start_simulationEXIT(lines 528 586) no Hoare annotation was computed. [2019-10-02 16:21:02,616 INFO L439 ceAbstractionStarter]: At program point L537(line 537) the Hoare annotation is: (or (= |old(~T1_E~0)| 0) (= |old(~T2_E~0)| 1) (not (<= |old(~token~0)| |old(~local~0)|)) (not (<= |old(~local~0)| |old(~token~0)|)) (= |old(~T2_E~0)| 0) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~E_M~0)|) (not (= 0 |old(~m_st~0)|)) (not (= ~m_i~0 1)) (= 1 |old(~t2_pc~0)|) (= 1 |old(~E_1~0)|) (= 1 |old(~E_2~0)|) (= 0 |old(~E_1~0)|) (not (= 1 ~t1_i~0)) (not (= 1 ~t2_i~0)) (= 0 |old(~E_M~0)|) (= 0 |old(~E_2~0)|) (and (not (= ~t2_pc~0 1)) (<= ~t1_pc~0 0) (= ~m_st~0 0) (not (= ~m_pc~0 1)) (= |old(~token~0)| ~token~0) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (<= ~token~0 ~local~0) (= ~E_2~0 |old(~E_2~0)|) (= |old(~t1_st~0)| ~t1_st~0) (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (<= ~local~0 ~token~0)) (not (<= |old(~t1_pc~0)| 0)) (= 1 |old(~m_pc~0)|)) [2019-10-02 16:21:02,616 INFO L439 ceAbstractionStarter]: At program point L566(line 566) the Hoare annotation is: (let ((.cse0 (= ~m_pc~0 1)) (.cse1 (= 1 ~t1_pc~0)) (.cse2 (= 1 ~t2_pc~0)) (.cse3 (not (= 1 ~E_2~0))) (.cse4 (<= 2 ~m_st~0)) (.cse5 (not (= ~E_M~0 0))) (.cse6 (<= 2 ~t1_st~0)) (.cse7 (not (= ~E_1~0 1))) (.cse8 (= |old(~T2_E~0)| ~T2_E~0)) (.cse9 (not (= ~T1_E~0 0))) (.cse10 (not (= ~E_1~0 0))) (.cse11 (not (= ~E_2~0 0))) (.cse12 (not (= ~E_M~0 1)))) (or (= |old(~T1_E~0)| 0) (= |old(~T2_E~0)| 1) (not (<= |old(~token~0)| |old(~local~0)|)) (not (<= |old(~local~0)| |old(~token~0)|)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= 2 ~t2_st~0) .cse8 .cse9 .cse10 .cse11 .cse12) (= |old(~T2_E~0)| 0) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~E_M~0)|) (and (not (= ~t2_pc~0 1)) .cse0 .cse1 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 (= ~E_M~0 |old(~E_M~0)|) .cse11) (not (= 0 |old(~m_st~0)|)) (not (= ~m_i~0 1)) (= 1 |old(~t2_pc~0)|) (= 1 |old(~E_1~0)|) (= 1 |old(~E_2~0)|) (= 0 |old(~E_1~0)|) (not (= 1 ~t1_i~0)) (not (= 1 ~t2_i~0)) (= 0 |old(~E_M~0)|) (= 0 |old(~E_2~0)|) (not (<= |old(~t1_pc~0)| 0)) (= 1 |old(~m_pc~0)|) (let ((.cse13 (+ ~local~0 1))) (and .cse0 .cse1 (<= ~token~0 .cse13) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= .cse13 ~token~0) .cse10 .cse11 .cse12)))) [2019-10-02 16:21:02,616 INFO L443 ceAbstractionStarter]: For program point L562(lines 562 571) no Hoare annotation was computed. [2019-10-02 16:21:02,617 INFO L439 ceAbstractionStarter]: At program point L562-1(lines 562 571) the Hoare annotation is: (let ((.cse2 (not (= 1 ~E_2~0))) (.cse1 (= |old(~T2_E~0)| ~T2_E~0)) (.cse3 (= ~m_pc~0 1)) (.cse4 (not (= ~T1_E~0 0))) (.cse5 (<= 2 ~m_st~0)) (.cse6 (not (= ~E_1~0 0))) (.cse7 (not (= 1 ~M_E~0))) (.cse8 (not (= ~E_2~0 0))) (.cse9 (not (= ~E_1~0 1)))) (let ((.cse0 (= 1 ~t1_pc~0)) (.cse12 (and .cse2 (and .cse1 (not (= 1 ~T2_E~0)) (and .cse3 .cse4 (= 1 ~t2_pc~0) (not (= ~T2_E~0 0)) .cse5 .cse6 (not (= ~E_M~0 0)) .cse7 .cse8) (not (= ~E_M~0 1))) .cse9)) (.cse10 (<= 2 ~t1_st~0))) (or (= |old(~T1_E~0)| 0) (= |old(~T2_E~0)| 1) (and .cse0 (and .cse1 .cse2 (and (not (= ~t2_pc~0 1)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) .cse9 (= ~E_M~0 |old(~E_M~0)|)) .cse10) (not (<= |old(~token~0)| |old(~local~0)|)) (not (<= |old(~local~0)| |old(~token~0)|)) (let ((.cse11 (+ ~local~0 1))) (and (<= ~token~0 .cse11) (<= .cse11 ~token~0) (and .cse0 .cse12 .cse10))) (= |old(~T2_E~0)| 0) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~E_M~0)|) (not (= 0 |old(~m_st~0)|)) (and (<= 2 ~t2_st~0) .cse0 .cse12 .cse10) (not (= ~m_i~0 1)) (= 1 |old(~t2_pc~0)|) (= 1 |old(~E_1~0)|) (= 1 |old(~E_2~0)|) (= 0 |old(~E_1~0)|) (not (= 1 ~t1_i~0)) (not (= 1 ~t2_i~0)) (= 0 |old(~E_M~0)|) (= 0 |old(~E_2~0)|) (not (<= |old(~t1_pc~0)| 0)) (= 1 |old(~m_pc~0)|)))) [2019-10-02 16:21:02,617 INFO L443 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2019-10-02 16:21:02,617 INFO L439 ceAbstractionStarter]: At program point L556(line 556) the Hoare annotation is: (let ((.cse0 (= ~m_pc~0 1)) (.cse1 (= 1 ~t1_pc~0)) (.cse11 (= 1 ~t2_pc~0)) (.cse2 (not (= 1 ~E_2~0))) (.cse3 (<= 2 ~m_st~0)) (.cse12 (not (= ~E_M~0 0))) (.cse4 (<= 2 ~t1_st~0)) (.cse5 (not (= ~E_1~0 1))) (.cse6 (= |old(~T2_E~0)| ~T2_E~0)) (.cse7 (not (= ~T1_E~0 0))) (.cse8 (not (= ~E_1~0 0))) (.cse9 (not (= ~E_2~0 0))) (.cse13 (not (= ~E_M~0 1)))) (or (= |old(~T1_E~0)| 0) (= |old(~T2_E~0)| 1) (not (<= |old(~token~0)| |old(~local~0)|)) (= |old(~T2_E~0)| 0) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (and (not (= ~t2_pc~0 1)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= ~E_M~0 |old(~E_M~0)|) .cse9) (= 1 |old(~t2_pc~0)|) (= 1 |old(~E_1~0)|) (= 1 |old(~E_2~0)|) (not (= 1 ~t1_i~0)) (= 0 |old(~E_2~0)|) (let ((.cse10 (+ ~local~0 1))) (and .cse0 .cse1 (<= ~token~0 .cse10) .cse11 .cse2 .cse3 .cse12 .cse4 .cse5 .cse6 .cse7 (<= .cse10 ~token~0) .cse8 .cse9 .cse13)) (not (<= |old(~local~0)| |old(~token~0)|)) (and .cse0 .cse1 .cse11 .cse2 .cse3 .cse12 .cse4 .cse5 (<= 2 ~t2_st~0) .cse6 .cse7 .cse8 .cse9 .cse13) (= 1 |old(~E_M~0)|) (not (= 0 |old(~m_st~0)|)) (not (= ~m_i~0 1)) (= 0 |old(~E_1~0)|) (not (= 1 ~t2_i~0)) (= 0 |old(~E_M~0)|) (not (<= |old(~t1_pc~0)| 0)) (= 1 |old(~m_pc~0)|))) [2019-10-02 16:21:02,617 INFO L439 ceAbstractionStarter]: At program point L581(lines 528 586) the Hoare annotation is: (or (= |old(~T1_E~0)| 0) (= |old(~T2_E~0)| 1) (not (<= |old(~token~0)| |old(~local~0)|)) (not (<= |old(~local~0)| |old(~token~0)|)) (= |old(~T2_E~0)| 0) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~E_M~0)|) (not (= ~T1_E~0 0)) (not (= 0 |old(~m_st~0)|)) (not (= ~m_i~0 1)) (= 1 |old(~t2_pc~0)|) (= 1 |old(~E_1~0)|) (= 1 |old(~E_2~0)|) (= 0 |old(~E_1~0)|) (not (= 1 ~t1_i~0)) (not (= 1 ~t2_i~0)) (= 0 |old(~E_M~0)|) (= 0 |old(~E_2~0)|) (not (<= |old(~t1_pc~0)| 0)) (= 1 |old(~m_pc~0)|)) [2019-10-02 16:21:02,618 INFO L439 ceAbstractionStarter]: At program point start_simulationENTRY(lines 528 586) the Hoare annotation is: (or (= |old(~T1_E~0)| 0) (= |old(~T2_E~0)| 1) (not (<= |old(~token~0)| |old(~local~0)|)) (not (<= |old(~local~0)| |old(~token~0)|)) (= |old(~T2_E~0)| 0) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~E_M~0)|) (not (= 0 |old(~m_st~0)|)) (not (= ~m_i~0 1)) (= 1 |old(~t2_pc~0)|) (= 1 |old(~E_1~0)|) (= 1 |old(~E_2~0)|) (= 0 |old(~E_1~0)|) (not (= 1 ~t1_i~0)) (not (= 1 ~t2_i~0)) (= 0 |old(~E_M~0)|) (= 0 |old(~E_2~0)|) (and (not (= ~t2_pc~0 1)) (<= ~t1_pc~0 0) (= ~m_st~0 0) (not (= ~m_pc~0 1)) (= |old(~token~0)| ~token~0) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (<= ~token~0 ~local~0) (= ~E_2~0 |old(~E_2~0)|) (= |old(~t1_st~0)| ~t1_st~0) (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (<= ~local~0 ~token~0)) (not (<= |old(~t1_pc~0)| 0)) (= 1 |old(~m_pc~0)|)) [2019-10-02 16:21:02,618 INFO L443 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2019-10-02 16:21:02,618 INFO L443 ceAbstractionStarter]: For program point L575(lines 575 579) no Hoare annotation was computed. [2019-10-02 16:21:02,618 INFO L443 ceAbstractionStarter]: For program point L573(line 573) no Hoare annotation was computed. [2019-10-02 16:21:02,618 INFO L439 ceAbstractionStarter]: At program point L538(line 538) the Hoare annotation is: (or (= |old(~T1_E~0)| 0) (= |old(~T2_E~0)| 1) (not (<= |old(~token~0)| |old(~local~0)|)) (not (<= |old(~local~0)| |old(~token~0)|)) (= |old(~T2_E~0)| 0) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (and (not (= ~t2_pc~0 1)) (<= ~t1_pc~0 0) (= ~m_st~0 0) (not (= ~m_pc~0 1)) (= |old(~token~0)| ~token~0) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (<= ~token~0 ~local~0) (= ~E_2~0 |old(~E_2~0)|) (= |old(~t1_st~0)| ~t1_st~0) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (<= ~local~0 ~token~0)) (= 1 |old(~E_M~0)|) (not (= 0 |old(~m_st~0)|)) (not (= ~m_i~0 1)) (= 1 |old(~t2_pc~0)|) (= 1 |old(~E_1~0)|) (= 1 |old(~E_2~0)|) (= 0 |old(~E_1~0)|) (not (= 1 ~t1_i~0)) (not (= 1 ~t2_i~0)) (= 0 |old(~E_M~0)|) (= 0 |old(~E_2~0)|) (not (<= |old(~t1_pc~0)| 0)) (= 1 |old(~m_pc~0)|)) [2019-10-02 16:21:02,619 INFO L439 ceAbstractionStarter]: At program point L536(line 536) the Hoare annotation is: (or (= |old(~T1_E~0)| 0) (= |old(~T2_E~0)| 1) (not (<= |old(~token~0)| |old(~local~0)|)) (not (<= |old(~local~0)| |old(~token~0)|)) (= |old(~T2_E~0)| 0) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~E_M~0)|) (not (= 0 |old(~m_st~0)|)) (not (= ~m_i~0 1)) (= 1 |old(~t2_pc~0)|) (= 1 |old(~E_1~0)|) (= 1 |old(~E_2~0)|) (= 0 |old(~E_1~0)|) (not (= 1 ~t1_i~0)) (not (= 1 ~t2_i~0)) (= 0 |old(~E_M~0)|) (= 0 |old(~E_2~0)|) (and (not (= ~t2_pc~0 1)) (<= ~t1_pc~0 0) (= ~m_st~0 0) (not (= ~m_pc~0 1)) (= |old(~token~0)| ~token~0) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (<= ~token~0 ~local~0) (= ~E_2~0 |old(~E_2~0)|) (= |old(~t1_st~0)| ~t1_st~0) (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (<= ~local~0 ~token~0)) (not (<= |old(~t1_pc~0)| 0)) (= 1 |old(~m_pc~0)|)) [2019-10-02 16:21:02,619 INFO L439 ceAbstractionStarter]: At program point L536-1(line 536) the Hoare annotation is: (or (= |old(~T1_E~0)| 0) (= |old(~T2_E~0)| 1) (not (<= |old(~token~0)| |old(~local~0)|)) (not (<= |old(~local~0)| |old(~token~0)|)) (= |old(~T2_E~0)| 0) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~E_M~0)|) (not (= 0 |old(~m_st~0)|)) (not (= ~m_i~0 1)) (= 1 |old(~t2_pc~0)|) (= 1 |old(~E_1~0)|) (= 1 |old(~E_2~0)|) (= 0 |old(~E_1~0)|) (not (= 1 ~t1_i~0)) (not (= 1 ~t2_i~0)) (= 0 |old(~E_M~0)|) (= 0 |old(~E_2~0)|) (and (not (= ~t2_pc~0 1)) (<= ~t1_pc~0 0) (= ~m_st~0 0) (not (= ~m_pc~0 1)) (= |old(~token~0)| ~token~0) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (<= ~token~0 ~local~0) (= ~E_2~0 |old(~E_2~0)|) (= |old(~t1_st~0)| ~t1_st~0) (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (<= ~local~0 ~token~0)) (not (<= |old(~t1_pc~0)| 0)) (= 1 |old(~m_pc~0)|)) [2019-10-02 16:21:02,619 INFO L439 ceAbstractionStarter]: At program point L565(line 565) the Hoare annotation is: (let ((.cse2 (not (= 1 ~E_2~0))) (.cse1 (= |old(~T2_E~0)| ~T2_E~0)) (.cse3 (= ~m_pc~0 1)) (.cse4 (not (= ~T1_E~0 0))) (.cse5 (<= 2 ~m_st~0)) (.cse6 (not (= ~E_1~0 0))) (.cse7 (not (= 1 ~M_E~0))) (.cse8 (not (= ~E_2~0 0))) (.cse9 (not (= ~E_1~0 1)))) (let ((.cse0 (= 1 ~t1_pc~0)) (.cse12 (and .cse2 (and .cse1 (not (= 1 ~T2_E~0)) (and .cse3 .cse4 (= 1 ~t2_pc~0) (not (= ~T2_E~0 0)) .cse5 .cse6 (not (= ~E_M~0 0)) .cse7 .cse8) (not (= ~E_M~0 1))) .cse9)) (.cse10 (<= 2 ~t1_st~0))) (or (= |old(~T1_E~0)| 0) (= |old(~T2_E~0)| 1) (and .cse0 (and .cse1 .cse2 (and (not (= ~t2_pc~0 1)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) .cse9 (= ~E_M~0 |old(~E_M~0)|)) .cse10) (not (<= |old(~token~0)| |old(~local~0)|)) (not (<= |old(~local~0)| |old(~token~0)|)) (let ((.cse11 (+ ~local~0 1))) (and (<= ~token~0 .cse11) (<= .cse11 ~token~0) (and .cse0 .cse12 .cse10))) (= |old(~T2_E~0)| 0) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~E_M~0)|) (not (= 0 |old(~m_st~0)|)) (and (<= 2 ~t2_st~0) .cse0 .cse12 .cse10) (not (= ~m_i~0 1)) (= 1 |old(~t2_pc~0)|) (= 1 |old(~E_1~0)|) (= 1 |old(~E_2~0)|) (= 0 |old(~E_1~0)|) (not (= 1 ~t1_i~0)) (not (= 1 ~t2_i~0)) (= 0 |old(~E_M~0)|) (= 0 |old(~E_2~0)|) (not (<= |old(~t1_pc~0)| 0)) (= 1 |old(~m_pc~0)|)))) [2019-10-02 16:21:02,619 INFO L439 ceAbstractionStarter]: At program point L565-1(line 565) the Hoare annotation is: (let ((.cse0 (= ~m_pc~0 1)) (.cse1 (= 1 ~t1_pc~0)) (.cse2 (= 1 ~t2_pc~0)) (.cse3 (not (= 1 ~E_2~0))) (.cse4 (<= 2 ~m_st~0)) (.cse5 (not (= ~E_M~0 0))) (.cse6 (<= 2 ~t1_st~0)) (.cse7 (not (= ~E_1~0 1))) (.cse8 (= |old(~T2_E~0)| ~T2_E~0)) (.cse9 (not (= ~T1_E~0 0))) (.cse10 (not (= ~E_1~0 0))) (.cse11 (not (= ~E_2~0 0))) (.cse12 (not (= ~E_M~0 1)))) (or (= |old(~T1_E~0)| 0) (= |old(~T2_E~0)| 1) (not (<= |old(~token~0)| |old(~local~0)|)) (not (<= |old(~local~0)| |old(~token~0)|)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= 2 ~t2_st~0) .cse8 .cse9 .cse10 .cse11 .cse12) (= |old(~T2_E~0)| 0) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~E_M~0)|) (and (not (= ~t2_pc~0 1)) .cse0 .cse1 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 (= ~E_M~0 |old(~E_M~0)|) .cse11) (not (= 0 |old(~m_st~0)|)) (not (= ~m_i~0 1)) (= 1 |old(~t2_pc~0)|) (= 1 |old(~E_1~0)|) (= 1 |old(~E_2~0)|) (= 0 |old(~E_1~0)|) (not (= 1 ~t1_i~0)) (not (= 1 ~t2_i~0)) (= 0 |old(~E_M~0)|) (= 0 |old(~E_2~0)|) (not (<= |old(~t1_pc~0)| 0)) (= 1 |old(~m_pc~0)|) (let ((.cse13 (+ ~local~0 1))) (and .cse0 .cse1 (<= ~token~0 .cse13) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= .cse13 ~token~0) .cse10 .cse11 .cse12)))) [2019-10-02 16:21:02,620 INFO L439 ceAbstractionStarter]: At program point L557(line 557) the Hoare annotation is: (let ((.cse2 (not (= 1 ~E_2~0))) (.cse1 (= |old(~T2_E~0)| ~T2_E~0)) (.cse3 (= ~m_pc~0 1)) (.cse4 (not (= ~T1_E~0 0))) (.cse5 (<= 2 ~m_st~0)) (.cse6 (not (= ~E_1~0 0))) (.cse7 (not (= 1 ~M_E~0))) (.cse8 (not (= ~E_2~0 0))) (.cse9 (not (= ~E_1~0 1)))) (let ((.cse0 (= 1 ~t1_pc~0)) (.cse12 (and .cse2 (and .cse1 (not (= 1 ~T2_E~0)) (and .cse3 .cse4 (= 1 ~t2_pc~0) (not (= ~T2_E~0 0)) .cse5 .cse6 (not (= ~E_M~0 0)) .cse7 .cse8) (not (= ~E_M~0 1))) .cse9)) (.cse10 (<= 2 ~t1_st~0))) (or (= |old(~T1_E~0)| 0) (= |old(~T2_E~0)| 1) (and .cse0 (and .cse1 .cse2 (and (not (= ~t2_pc~0 1)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) .cse9 (= ~E_M~0 |old(~E_M~0)|)) .cse10) (not (<= |old(~token~0)| |old(~local~0)|)) (not (<= |old(~local~0)| |old(~token~0)|)) (let ((.cse11 (+ ~local~0 1))) (and (<= ~token~0 .cse11) (<= .cse11 ~token~0) (and .cse0 .cse12 .cse10))) (= |old(~T2_E~0)| 0) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~E_M~0)|) (not (= 0 |old(~m_st~0)|)) (and (<= 2 ~t2_st~0) .cse0 .cse12 .cse10) (not (= ~m_i~0 1)) (= 1 |old(~t2_pc~0)|) (= 1 |old(~E_1~0)|) (= 1 |old(~E_2~0)|) (= 0 |old(~E_1~0)|) (not (= 1 ~t1_i~0)) (not (= 1 ~t2_i~0)) (= 0 |old(~E_M~0)|) (= 0 |old(~E_2~0)|) (not (<= |old(~t1_pc~0)| 0)) (= 1 |old(~m_pc~0)|)))) [2019-10-02 16:21:02,620 INFO L439 ceAbstractionStarter]: At program point L555(line 555) the Hoare annotation is: (let ((.cse2 (not (= 1 ~E_2~0))) (.cse1 (= |old(~T2_E~0)| ~T2_E~0)) (.cse3 (= ~m_pc~0 1)) (.cse4 (not (= ~T1_E~0 0))) (.cse5 (<= 2 ~m_st~0)) (.cse6 (not (= ~E_1~0 0))) (.cse7 (not (= 1 ~M_E~0))) (.cse8 (not (= ~E_2~0 0))) (.cse9 (not (= ~E_1~0 1)))) (let ((.cse0 (= 1 ~t1_pc~0)) (.cse12 (and .cse2 (and .cse1 (not (= 1 ~T2_E~0)) (and .cse3 .cse4 (= 1 ~t2_pc~0) (not (= ~T2_E~0 0)) .cse5 .cse6 (not (= ~E_M~0 0)) .cse7 .cse8) (not (= ~E_M~0 1))) .cse9)) (.cse10 (<= 2 ~t1_st~0))) (or (= |old(~T1_E~0)| 0) (= |old(~T2_E~0)| 1) (and .cse0 (and .cse1 .cse2 (and (not (= ~t2_pc~0 1)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) .cse9 (= ~E_M~0 |old(~E_M~0)|)) .cse10) (not (<= |old(~token~0)| |old(~local~0)|)) (not (<= |old(~local~0)| |old(~token~0)|)) (let ((.cse11 (+ ~local~0 1))) (and (<= ~token~0 .cse11) (<= .cse11 ~token~0) (and .cse0 .cse12 .cse10))) (= |old(~T2_E~0)| 0) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~E_M~0)|) (not (= 0 |old(~m_st~0)|)) (and (<= 2 ~t2_st~0) .cse0 .cse12 .cse10) (not (= ~m_i~0 1)) (= 1 |old(~t2_pc~0)|) (= 1 |old(~E_1~0)|) (= 1 |old(~E_2~0)|) (= 0 |old(~E_1~0)|) (not (= 1 ~t1_i~0)) (not (= 1 ~t2_i~0)) (= 0 |old(~E_M~0)|) (= 0 |old(~E_2~0)|) (not (<= |old(~t1_pc~0)| 0)) (= 1 |old(~m_pc~0)|)))) [2019-10-02 16:21:02,620 INFO L439 ceAbstractionStarter]: At program point L555-1(line 555) the Hoare annotation is: (let ((.cse0 (= ~m_pc~0 1)) (.cse1 (= 1 ~t1_pc~0)) (.cse11 (= 1 ~t2_pc~0)) (.cse2 (not (= 1 ~E_2~0))) (.cse3 (<= 2 ~m_st~0)) (.cse12 (not (= ~E_M~0 0))) (.cse4 (<= 2 ~t1_st~0)) (.cse5 (not (= ~E_1~0 1))) (.cse6 (= |old(~T2_E~0)| ~T2_E~0)) (.cse7 (not (= ~T1_E~0 0))) (.cse8 (not (= ~E_1~0 0))) (.cse9 (not (= ~E_2~0 0))) (.cse13 (not (= ~E_M~0 1)))) (or (= |old(~T1_E~0)| 0) (= |old(~T2_E~0)| 1) (not (<= |old(~token~0)| |old(~local~0)|)) (= |old(~T2_E~0)| 0) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (and (not (= ~t2_pc~0 1)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= ~E_M~0 |old(~E_M~0)|) .cse9) (= 1 |old(~t2_pc~0)|) (= 1 |old(~E_1~0)|) (= 1 |old(~E_2~0)|) (not (= 1 ~t1_i~0)) (= 0 |old(~E_2~0)|) (let ((.cse10 (+ ~local~0 1))) (and .cse0 .cse1 (<= ~token~0 .cse10) .cse11 .cse2 .cse3 .cse12 .cse4 .cse5 .cse6 .cse7 (<= .cse10 ~token~0) .cse8 .cse9 .cse13)) (not (<= |old(~local~0)| |old(~token~0)|)) (and .cse0 .cse1 .cse11 .cse2 .cse3 .cse12 .cse4 .cse5 (<= 2 ~t2_st~0) .cse6 .cse7 .cse8 .cse9 .cse13) (= 1 |old(~E_M~0)|) (not (= 0 |old(~m_st~0)|)) (not (= ~m_i~0 1)) (= 0 |old(~E_1~0)|) (not (= 1 ~t2_i~0)) (= 0 |old(~E_M~0)|) (not (<= |old(~t1_pc~0)| 0)) (= 1 |old(~m_pc~0)|))) [2019-10-02 16:21:02,621 INFO L439 ceAbstractionStarter]: At program point L551(line 551) the Hoare annotation is: (let ((.cse2 (not (= 1 ~E_2~0))) (.cse1 (= |old(~T2_E~0)| ~T2_E~0)) (.cse3 (= ~m_pc~0 1)) (.cse4 (not (= ~T1_E~0 0))) (.cse5 (<= 2 ~m_st~0)) (.cse6 (not (= ~E_1~0 0))) (.cse7 (not (= 1 ~M_E~0))) (.cse8 (not (= ~E_2~0 0))) (.cse9 (not (= ~E_1~0 1)))) (let ((.cse0 (= 1 ~t1_pc~0)) (.cse12 (and .cse2 (and .cse1 (not (= 1 ~T2_E~0)) (and .cse3 .cse4 (= 1 ~t2_pc~0) (not (= ~T2_E~0 0)) .cse5 .cse6 (not (= ~E_M~0 0)) .cse7 .cse8) (not (= ~E_M~0 1))) .cse9)) (.cse10 (<= 2 ~t1_st~0))) (or (= |old(~T1_E~0)| 0) (= |old(~T2_E~0)| 1) (and .cse0 (and .cse1 .cse2 (and (not (= ~t2_pc~0 1)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) .cse9 (= ~E_M~0 |old(~E_M~0)|)) .cse10) (not (<= |old(~token~0)| |old(~local~0)|)) (not (<= |old(~local~0)| |old(~token~0)|)) (let ((.cse11 (+ ~local~0 1))) (and (<= ~token~0 .cse11) (<= .cse11 ~token~0) (and .cse0 .cse12 .cse10))) (= |old(~T2_E~0)| 0) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~E_M~0)|) (not (= 0 |old(~m_st~0)|)) (and (<= 2 ~t2_st~0) .cse0 .cse12 .cse10) (not (= ~m_i~0 1)) (= 1 |old(~t2_pc~0)|) (= 1 |old(~E_1~0)|) (= 1 |old(~E_2~0)|) (= 0 |old(~E_1~0)|) (not (= 1 ~t1_i~0)) (not (= 1 ~t2_i~0)) (= 0 |old(~E_M~0)|) (= 0 |old(~E_2~0)|) (not (<= |old(~t1_pc~0)| 0)) (= 1 |old(~m_pc~0)|)))) [2019-10-02 16:21:02,621 INFO L443 ceAbstractionStarter]: For program point L551-1(line 551) no Hoare annotation was computed. [2019-10-02 16:21:02,621 INFO L439 ceAbstractionStarter]: At program point L547(line 547) the Hoare annotation is: (let ((.cse5 (not (= 1 ~E_2~0))) (.cse7 (= |old(~T2_E~0)| ~T2_E~0)) (.cse6 (= ~m_pc~0 1)) (.cse10 (not (= ~T1_E~0 0))) (.cse12 (<= 2 ~m_st~0)) (.cse13 (not (= ~E_1~0 0))) (.cse8 (not (= 1 ~M_E~0))) (.cse9 (not (= ~E_2~0 0))) (.cse14 (not (= ~E_1~0 1)))) (let ((.cse4 (not (= ~t2_pc~0 1))) (.cse11 (= ~E_M~0 |old(~E_M~0)|)) (.cse1 (= 1 ~t1_pc~0)) (.cse2 (and .cse5 (and .cse7 (not (= 1 ~T2_E~0)) (and .cse6 .cse10 (= 1 ~t2_pc~0) (not (= ~T2_E~0 0)) .cse12 (= ~t1_i~0 1) .cse13 (not (= ~E_M~0 0)) .cse8 .cse9) (not (= ~E_M~0 1))) .cse14)) (.cse3 (<= 2 ~t1_st~0))) (or (= |old(~T1_E~0)| 0) (= |old(~T2_E~0)| 1) (not (<= |old(~token~0)| |old(~local~0)|)) (let ((.cse0 (+ ~local~0 1))) (and (<= ~token~0 .cse0) (<= .cse0 ~token~0) (and .cse1 .cse2 .cse3))) (= |old(~T2_E~0)| 0) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~t2_pc~0)|) (= 1 |old(~E_1~0)|) (= 1 |old(~E_2~0)|) (not (= 1 ~t1_i~0)) (= 0 |old(~E_2~0)|) (and .cse4 (<= ~t1_pc~0 0) .cse5 (= ~m_st~0 0) (not .cse6) (= |old(~token~0)| ~token~0) .cse7 (= ~E_1~0 |old(~E_1~0)|) (<= ~token~0 ~local~0) .cse8 .cse9 .cse10 (= |old(~t1_st~0)| ~t1_st~0) .cse11 (<= ~local~0 ~token~0)) (and .cse1 (and .cse7 .cse5 (and .cse4 .cse6 .cse10 .cse12 .cse13 .cse8 .cse9) .cse14 .cse11) .cse3) (not (<= |old(~local~0)| |old(~token~0)|)) (= 1 |old(~E_M~0)|) (not (= 0 |old(~m_st~0)|)) (and (<= 2 ~t2_st~0) .cse1 .cse2 .cse3) (not (= ~m_i~0 1)) (= 0 |old(~E_1~0)|) (not (= 1 ~t2_i~0)) (= 0 |old(~E_M~0)|) (not (<= |old(~t1_pc~0)| 0)) (= 1 |old(~m_pc~0)|)))) [2019-10-02 16:21:02,621 INFO L443 ceAbstractionStarter]: For program point L547-1(line 547) no Hoare annotation was computed. [2019-10-02 16:21:02,622 INFO L443 ceAbstractionStarter]: For program point L157(lines 157 162) no Hoare annotation was computed. [2019-10-02 16:21:02,622 INFO L443 ceAbstractionStarter]: For program point L156(lines 156 165) no Hoare annotation was computed. [2019-10-02 16:21:02,622 INFO L443 ceAbstractionStarter]: For program point L156-2(lines 156 165) no Hoare annotation was computed. [2019-10-02 16:21:02,622 INFO L443 ceAbstractionStarter]: For program point is_master_triggeredFINAL(lines 152 170) no Hoare annotation was computed. [2019-10-02 16:21:02,622 INFO L443 ceAbstractionStarter]: For program point is_master_triggeredEXIT(lines 152 170) no Hoare annotation was computed. [2019-10-02 16:21:02,622 INFO L439 ceAbstractionStarter]: At program point L167(lines 155 169) the Hoare annotation is: (let ((.cse19 (= 1 ~E_1~0)) (.cse16 (= 1 ~m_pc~0)) (.cse22 (= ~t1_st~0 0)) (.cse30 (+ ~local~0 1))) (let ((.cse24 (not (<= .cse30 ~token~0))) (.cse25 (not (<= ~token~0 .cse30))) (.cse4 (not .cse22)) (.cse15 (not (<= ~t1_pc~0 0))) (.cse18 (not (<= 2 ~m_st~0))) (.cse20 (not .cse16)) (.cse21 (= 0 ~E_1~0)) (.cse0 (= ~T1_E~0 0)) (.cse26 (not (<= 2 ~t2_st~0))) (.cse1 (= ~T2_E~0 1)) (.cse28 (not (<= ~token~0 ~local~0))) (.cse17 (not (= ~t1_pc~0 1))) (.cse29 (not (<= ~local~0 ~token~0))) (.cse2 (= ~T2_E~0 0)) (.cse3 (= 1 ~M_E~0)) (.cse5 (= 1 ~E_M~0)) (.cse8 (= 1 ~t2_pc~0)) (.cse23 (not (<= 2 ~t1_st~0))) (.cse6 (not .cse19)) (.cse7 (not (= ~m_i~0 1))) (.cse9 (= 1 ~E_2~0)) (.cse11 (not (= 1 ~t1_i~0))) (.cse12 (not (= 1 ~t2_i~0))) (.cse13 (= 0 ~E_M~0)) (.cse14 (= 0 ~E_2~0)) (.cse10 (= 0 is_master_triggered_~__retres1~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse0 .cse1 .cse17 .cse18 .cse2 .cse3 .cse5 .cse7 .cse8 .cse19 .cse20 .cse10 .cse21 .cse11 .cse12 .cse13 .cse14 .cse22) (or .cse0 .cse1 .cse10 .cse17 .cse18 .cse2 .cse5 .cse23 .cse24 .cse7 .cse19 .cse9 .cse20 .cse21 .cse11 .cse12 .cse25 .cse13 .cse14) (or .cse0 .cse26 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse10 .cse7 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (let ((.cse27 (+ ~local~0 2))) (or .cse0 .cse1 .cse10 (not (<= ~token~0 .cse27)) .cse17 .cse5 .cse18 .cse2 .cse3 .cse23 .cse7 .cse19 .cse9 .cse20 .cse21 .cse11 .cse12 .cse13 .cse14 (not (<= .cse27 ~token~0)))) (or .cse0 .cse26 .cse1 .cse17 .cse18 .cse2 .cse3 .cse5 .cse24 .cse7 .cse19 .cse20 .cse21 .cse11 .cse12 .cse25 .cse13 .cse14 .cse22 .cse10) (or .cse0 .cse1 .cse28 .cse29 .cse10 .cse2 .cse4 .cse5 (not (= 0 ~m_st~0)) .cse7 .cse8 .cse19 .cse9 .cse21 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse0 .cse1 .cse28 .cse17 .cse29 .cse2 .cse3 .cse5 .cse23 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16) (or .cse0 .cse26 .cse1 .cse17 .cse18 .cse2 .cse5 .cse23 .cse7 .cse19 .cse9 .cse20 .cse10 .cse21 .cse11 .cse12 .cse13 .cse14) (or .cse0 .cse1 .cse10 .cse17 .cse18 .cse2 .cse5 .cse23 .cse7 .cse8 .cse19 .cse9 .cse20 .cse21 .cse11 .cse12 .cse13 .cse14) (or .cse0 .cse26 .cse1 .cse28 .cse17 .cse29 .cse2 .cse3 .cse5 (not .cse8) .cse23 .cse6 .cse7 .cse9 .cse11 .cse12 .cse13 .cse14 .cse10)))) [2019-10-02 16:21:02,623 INFO L446 ceAbstractionStarter]: At program point is_master_triggeredENTRY(lines 152 170) the Hoare annotation is: true [2019-10-02 16:21:02,623 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-02 16:21:02,623 INFO L439 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (not (= ~t2_pc~0 1)) (<= ~t1_pc~0 0) (not (= ~T2_E~0 0)) (not (= ~t1_i~0 1)) (not (= 1 ~E_2~0)) (= ~m_st~0 0) (not (= 1 ~m_i~0)) (not (= ~E_M~0 0)) (= 0 ~t1_st~0) (not (= ~E_1~0 1)) (not (= ~m_pc~0 1)) (not (= ~T1_E~0 0)) (not (= 1 ~T2_E~0)) (not (= ~t2_i~0 1)) (<= ~token~0 ~local~0) (not (= ~E_1~0 0)) (not (= 1 ~M_E~0)) (<= ~local~0 ~token~0) (not (= ~E_2~0 0)) (not (= ~E_M~0 1))) [2019-10-02 16:21:02,623 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-02 16:21:02,623 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-02 16:21:02,623 INFO L443 ceAbstractionStarter]: For program point L479-1(lines 463 496) no Hoare annotation was computed. [2019-10-02 16:21:02,623 INFO L443 ceAbstractionStarter]: For program point reset_time_eventsEXIT(lines 460 497) no Hoare annotation was computed. [2019-10-02 16:21:02,624 INFO L443 ceAbstractionStarter]: For program point L469-1(lines 463 496) no Hoare annotation was computed. [2019-10-02 16:21:02,624 INFO L443 ceAbstractionStarter]: For program point L484-1(lines 463 496) no Hoare annotation was computed. [2019-10-02 16:21:02,624 INFO L443 ceAbstractionStarter]: For program point L474-1(lines 463 496) no Hoare annotation was computed. [2019-10-02 16:21:02,624 INFO L439 ceAbstractionStarter]: At program point reset_time_eventsENTRY(lines 460 497) the Hoare annotation is: (let ((.cse16 (= |old(~T2_E~0)| ~T2_E~0)) (.cse19 (= ~E_1~0 |old(~E_1~0)|)) (.cse21 (= ~E_2~0 |old(~E_2~0)|)) (.cse17 (= ~M_E~0 |old(~M_E~0)|)) (.cse18 (= |old(~T1_E~0)| ~T1_E~0)) (.cse20 (= ~E_M~0 |old(~E_M~0)|))) (let ((.cse0 (= |old(~T1_E~0)| 0)) (.cse1 (= |old(~T2_E~0)| 1)) (.cse2 (not (= ~t1_pc~0 1))) (.cse3 (not (<= 2 ~m_st~0))) (.cse4 (= |old(~T2_E~0)| 0)) (.cse22 (and .cse16 .cse19 .cse21 .cse17 .cse18 .cse20)) (.cse5 (= 1 |old(~E_M~0)|)) (.cse6 (not (<= 2 ~t1_st~0))) (.cse7 (not (= ~m_i~0 1))) (.cse8 (= 1 |old(~E_1~0)|)) (.cse9 (= 1 |old(~E_2~0)|)) (.cse10 (not (= 1 ~m_pc~0))) (.cse11 (= 0 |old(~E_1~0)|)) (.cse12 (not (= 1 ~t1_i~0))) (.cse13 (not (= 1 ~t2_i~0))) (.cse14 (= 0 |old(~E_M~0)|)) (.cse15 (= 0 |old(~E_2~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= 1 ~t2_pc~0) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (and .cse16 .cse17 .cse18 .cse19 .cse20 .cse21)) (or .cse0 (not (<= 2 ~t2_st~0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse22 .cse12 .cse13 .cse14 .cse15) (let ((.cse23 (+ ~local~0 1))) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse22 .cse5 .cse6 (not (<= .cse23 ~token~0)) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (not (<= ~token~0 .cse23)) .cse14 .cse15))))) [2019-10-02 16:21:02,624 INFO L443 ceAbstractionStarter]: For program point L464-1(lines 463 496) no Hoare annotation was computed. [2019-10-02 16:21:02,624 INFO L443 ceAbstractionStarter]: For program point L489-1(lines 460 497) no Hoare annotation was computed. [2019-10-02 16:21:02,624 INFO L443 ceAbstractionStarter]: For program point init_modelFINAL(lines 498 508) no Hoare annotation was computed. [2019-10-02 16:21:02,625 INFO L443 ceAbstractionStarter]: For program point init_modelEXIT(lines 498 508) no Hoare annotation was computed. [2019-10-02 16:21:02,625 INFO L439 ceAbstractionStarter]: At program point init_modelENTRY(lines 498 508) the Hoare annotation is: (or (= ~T1_E~0 0) (and (not (= ~t1_i~0 1)) (not (= 1 ~m_i~0)) (not (= ~t2_i~0 1))) (= 1 |old(~t2_i~0)|) (= ~T2_E~0 1) (not (<= ~token~0 ~local~0)) (not (<= ~local~0 ~token~0)) (= 1 |old(~t1_i~0)|) (= ~T2_E~0 0) (= 1 ~M_E~0) (= |old(~m_i~0)| 1) (not (= ~t1_st~0 0)) (= 1 ~E_M~0) (not (= 0 ~m_st~0)) (= 1 ~t2_pc~0) (= 1 ~E_1~0) (= 1 ~E_2~0) (= 0 ~E_1~0) (= 0 ~E_M~0) (= 0 ~E_2~0) (not (<= ~t1_pc~0 0)) (= 1 ~m_pc~0)) [2019-10-02 16:21:02,715 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.10 04:21:02 BoogieIcfgContainer [2019-10-02 16:21:02,715 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-02 16:21:02,717 INFO L168 Benchmark]: Toolchain (without parser) took 87904.32 ms. Allocated memory was 132.6 MB in the beginning and 1.6 GB in the end (delta: 1.5 GB). Free memory was 88.3 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2019-10-02 16:21:02,718 INFO L168 Benchmark]: CDTParser took 0.49 ms. Allocated memory is still 132.6 MB. Free memory was 106.8 MB in the beginning and 106.6 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-10-02 16:21:02,719 INFO L168 Benchmark]: CACSL2BoogieTranslator took 467.92 ms. Allocated memory was 132.6 MB in the beginning and 198.2 MB in the end (delta: 65.5 MB). Free memory was 88.1 MB in the beginning and 172.6 MB in the end (delta: -84.5 MB). Peak memory consumption was 27.4 MB. Max. memory is 7.1 GB. [2019-10-02 16:21:02,719 INFO L168 Benchmark]: Boogie Preprocessor took 51.77 ms. Allocated memory is still 198.2 MB. Free memory was 172.6 MB in the beginning and 170.1 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. [2019-10-02 16:21:02,720 INFO L168 Benchmark]: RCFGBuilder took 716.11 ms. Allocated memory is still 198.2 MB. Free memory was 170.1 MB in the beginning and 132.6 MB in the end (delta: 37.5 MB). Peak memory consumption was 37.5 MB. Max. memory is 7.1 GB. [2019-10-02 16:21:02,721 INFO L168 Benchmark]: TraceAbstraction took 86660.13 ms. Allocated memory was 198.2 MB in the beginning and 1.6 GB in the end (delta: 1.4 GB). Free memory was 132.6 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2019-10-02 16:21:02,724 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.49 ms. Allocated memory is still 132.6 MB. Free memory was 106.8 MB in the beginning and 106.6 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 467.92 ms. Allocated memory was 132.6 MB in the beginning and 198.2 MB in the end (delta: 65.5 MB). Free memory was 88.1 MB in the beginning and 172.6 MB in the end (delta: -84.5 MB). Peak memory consumption was 27.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 51.77 ms. Allocated memory is still 198.2 MB. Free memory was 172.6 MB in the beginning and 170.1 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 716.11 ms. Allocated memory is still 198.2 MB. Free memory was 170.1 MB in the beginning and 132.6 MB in the end (delta: 37.5 MB). Peak memory consumption was 37.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 86660.13 ms. Allocated memory was 198.2 MB in the beginning and 1.6 GB in the end (delta: 1.4 GB). Free memory was 132.6 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.5 GB. 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: 119]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(t1_pc == 1)) || !(2 <= \old(m_st))) || T2_E == 0) || 1 == M_E) || (((2 <= m_st && !(E_M == 0)) && \old(t1_st) == t1_st) && !(E_M == 1))) || 1 == \old(E_M)) || !(2 <= \old(t1_st))) || (((((m_st == 0 && !(E_M == 0)) && \old(t1_st) == t1_st) && local + 2 <= token) && !(E_M == 1)) && token <= local + 2)) || !(local + 1 <= \old(token))) || !(m_i == 1)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || !(\old(token) <= local + 1)) || 0 == \old(E_M)) || 0 == E_2) && ((((((((((((((((((T1_E == 0 || ((2 <= m_st && \old(t1_st) == t1_st) && E_M == \old(E_M))) || T2_E == 1) || !(t1_pc == 1)) || !(2 <= \old(m_st))) || T2_E == 0) || 1 == M_E) || 1 == \old(E_M)) || !(2 <= \old(t1_st))) || !(m_i == 1)) || 1 == \old(t2_pc)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 == E_2)) && ((((((((((((((((((((T1_E == 0 || ((((m_st == 0 && \old(t1_st) == t1_st) && token <= local) && E_M == \old(E_M)) && local <= token)) || T2_E == 1) || !(\old(token) <= local)) || !(t1_pc == 1)) || !(local <= \old(token))) || T2_E == 0) || 1 == M_E) || 1 == \old(E_M)) || !(2 <= \old(t1_st))) || !(0 == \old(m_st))) || !(m_i == 1)) || 1 == \old(t2_pc)) || 1 == E_1) || 1 == E_2) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 == E_2) || 1 == m_pc)) && ((((((((((((((((((((((((m_st == 0 && \old(t1_st) == t1_st) && token <= local) && E_M == \old(E_M)) && local <= token) || T1_E == 0) || T2_E == 1) || !(\old(token) <= local)) || !(local <= \old(token))) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_M)) || !(0 == \old(m_st))) || !(m_i == 1)) || 1 == \old(t2_pc)) || 1 == E_1) || 1 == E_2) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 == E_2) || !(t1_pc <= 0)) || 1 == m_pc)) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(\old(token) <= local)) || !(t1_pc == 1)) || !(local <= \old(token))) || !(2 <= \old(m_st))) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_M)) || !(m_i == 1)) || 1 == \old(t2_pc)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 == E_2) || (((((((((((m_pc == 1 && !(T1_E == 0)) && !(T2_E == 0)) && 2 <= m_st) && t1_i == 1) && !(E_1 == 0)) && !(E_M == 0)) && 0 == t1_st) && !(E_2 == 0)) && token <= local) && E_M == \old(E_M)) && local <= token))) && ((((((((((((((((((T1_E == 0 || (((((((((m_pc == 1 && !(T1_E == 0)) && !(T2_E == 0)) && 2 <= m_st) && t1_i == 1) && !(E_1 == 0)) && !(E_M == 0)) && 0 == t1_st) && !(E_2 == 0)) && E_M == \old(E_M))) || T2_E == 1) || !(2 <= \old(m_st))) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_M)) || !(m_i == 1)) || 1 == \old(t2_pc)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 == E_2) || !(t1_pc <= 0)) - InvariantResult [Line: 513]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 193]: Loop Invariant Derived loop invariant: (((((((((((((((((!(1 == E_1) || __retres1 == 0) || ((((((((((T1_E == 0 || T2_E == 1) || T2_E == 0) || 1 == M_E) || 1 == E_M) || !(m_i == 1)) || 1 == t2_pc) || 1 == E_2) || !(1 == t1_i)) || 0 == E_M) || 0 == E_2) || 1 == m_pc) || !(1 == t2_i)) || !(t1_pc <= 0)) || !(t1_st == 0)) && (((((((((((((((((((__retres1 == 0 || T1_E == 0) || T2_E == 1) || !(token <= local)) || !(local <= token)) || T2_E == 0) || !(t1_st == 0)) || 1 == E_M) || !(0 == m_st)) || !(m_i == 1)) || 1 == t2_pc) || 1 == E_1) || 1 == E_2) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || !(t1_pc <= 0)) || 1 == m_pc)) && (((((((((((((((((T1_E == 0 || T2_E == 1) || !(t1_pc == 1)) || !(2 <= m_st)) || T2_E == 0) || 1 == E_M) || !(2 <= t1_st)) || !(m_i == 1)) || 1 == t2_pc) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || __retres1 == 0) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2)) && ((((((!(1 == E_1) || __retres1 == 0) || !(2 <= t2_st)) || (((((((((T1_E == 0 || T2_E == 1) || T2_E == 0) || 1 == M_E) || 1 == E_M) || !(m_i == 1)) || 1 == E_2) || !(1 == t1_i)) || 0 == E_M) || 0 == E_2) || 1 == m_pc) || !(1 == t2_i)) || !(t1_pc <= 0)) || !(t1_st == 0))) && ((((((!(1 == E_1) || !(2 <= t1_st)) || !(2 <= t2_st)) || 1 == E_2 || ((((((((1 == E_M || !(1 == t2_pc)) || T1_E == 0) || !(m_i == 1)) || T2_E == 1) || !(1 == t1_i)) || 0 == E_M) || 0 == E_2) || T2_E == 0) || 1 == M_E) || !(t1_pc == 1)) || __retres1 == 0) || !(1 == t2_i))) && (((((((((((((((((!(1 == E_M) || T1_E == 0) || T2_E == 1) || !(t1_pc == 1)) || !(2 <= m_st)) || T2_E == 0) || 1 == M_E) || !(1 == t2_pc)) || !(2 <= t1_st)) || !(m_i == 1)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || __retres1 == 0) || !(1 == t2_i)) || 0 == E_2)) && ((((((!(token <= local) || !(t1_pc == 1)) || !(local <= token)) || __retres1 == 0) || (((((((((((T1_E == 0 || T2_E == 1) || T2_E == 0) || 1 == M_E) || 1 == E_M) || !(1 == E_1)) || !(m_i == 1)) || 1 == t2_pc) || 1 == E_2) || !(1 == t1_i)) || 0 == E_M) || 0 == E_2) || 1 == m_pc) || !(1 == t2_i)) || !(t1_st == 0))) && (((((((((((((((((((!(1 == E_M) || T1_E == 0) || T2_E == 1) || !(token <= local + 2)) || !(t1_pc == 1)) || T2_E == 0) || 1 == M_E) || !(1 == t2_pc)) || __retres1 == 0) || !(2 <= t1_st)) || !(0 == m_st)) || !(m_i == 1)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_2) || !(local + 2 <= token))) && (((((((((((((((((T1_E == 0 || !(2 <= t2_st)) || T2_E == 1) || !(t1_pc == 1)) || __retres1 == 0) || !(2 <= m_st)) || T2_E == 0) || 1 == E_M) || !(2 <= t1_st)) || !(m_i == 1)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2)) && (((((!(1 == E_1) || !(2 <= t1_st)) || 1 == E_2 || (((((((((1 == E_M || T1_E == 0) || 1 == t2_pc) || !(m_i == 1)) || T2_E == 1) || !(1 == t1_i)) || 0 == E_M) || 0 == E_2) || T2_E == 0) || 1 == m_pc) || 1 == M_E) || !(t1_pc == 1)) || !(1 == t2_i)) || __retres1 == 0)) && ((((((((((((((((((((T1_E == 0 || !(2 <= t2_st)) || T2_E == 1) || !(t1_pc == 1)) || !(2 <= m_st)) || T2_E == 0) || 1 == M_E) || 1 == E_M) || __retres1 == 0) || !(local + 1 <= token)) || !(m_i == 1)) || 1 == E_1) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || !(token <= local + 1)) || 0 == E_M) || 0 == E_2) || 1 == E_2) || t1_st == 0)) && (((((((((((((((((T1_E == 0 || T2_E == 1) || !(t1_pc == 1)) || !(2 <= m_st)) || T2_E == 0) || 1 == M_E) || 1 == E_M) || !(m_i == 1)) || 1 == t2_pc) || 1 == E_1) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || __retres1 == 0) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || t1_st == 0)) && (((((((!(2 <= t2_st) || !(token <= local)) || !(t1_pc == 1)) || !(local <= token)) || __retres1 == 0) || ((((((((((T1_E == 0 || T2_E == 1) || T2_E == 0) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || !(1 == E_1)) || !(m_i == 1)) || 1 == E_2) || !(1 == t1_i)) || 0 == E_M) || 0 == E_2) || !(1 == t2_i)) || !(t1_st == 0))) && ((((((((((((((((((__retres1 == 0 || T1_E == 0) || T2_E == 1) || !(t1_pc == 1)) || !(2 <= m_st)) || T2_E == 0) || 1 == E_M) || !(2 <= t1_st)) || !(local + 1 <= token)) || !(m_i == 1)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || !(token <= local + 1)) || 0 == E_M) || 0 == E_2) - InvariantResult [Line: 80]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(\old(t1_pc) == 1)) || !(2 <= \old(m_st))) || T2_E == 0) || (((((((1 == t1_pc && !(T2_E == 0)) && !(1 == E_2)) && 2 <= m_st) && 2 <= t1_st) && !(T1_E == 0)) && !(1 == T2_E)) && !(E_2 == 0))) || 1 == M_E) || 1 == E_M) || !(m_i == 1)) || 1 == t2_pc) || 1 == E_1) || 1 == \old(E_2)) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == \old(E_2)) || \old(t1_st) == 0) && (((((((((((((((((((((T1_E == 0 || !(2 <= \old(t2_st))) || (((((((1 == t1_pc && !(1 == E_2)) && m_st == 0) && 2 <= t1_st) && token <= local) && !(E_2 == 0)) && 2 <= t2_st) && local <= token)) || T2_E == 1) || !(\old(token) <= local)) || !(local <= \old(token))) || T2_E == 0) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || !(0 == \old(m_st))) || !(m_i == 1)) || 1 == E_1) || 1 == \old(E_2)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == \old(E_2)) || \old(t1_st) == 0) || !(\old(t1_pc) <= 0)) || 1 == m_pc)) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(\old(token) <= local)) || !(local <= \old(token))) || ((((((1 == t1_pc && !(1 == E_2)) && m_st == 0) && 2 <= t1_st) && token <= local) && !(E_2 == 0)) && local <= token)) || T2_E == 0) || 1 == M_E) || 1 == E_M) || !(0 == \old(m_st))) || !(m_i == 1)) || 1 == t2_pc) || 1 == E_1) || 1 == \old(E_2)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == \old(E_2)) || \old(t1_st) == 0) || !(\old(t1_pc) <= 0)) || 1 == m_pc)) && ((((((((((((((((((((((T1_E == 0 || !(2 <= \old(t2_st))) || ((((((1 == t1_pc && !(1 == E_2)) && 2 <= m_st) && 2 <= t1_st) && token <= \old(token) + 1) && !(E_2 == 0)) && local + 1 <= token)) || T2_E == 1) || !(\old(token) <= local)) || !(\old(t1_pc) == 1)) || !(local <= \old(token))) || !(2 <= \old(m_st))) || T2_E == 0) || ((((((((1 == t1_pc && !(T2_E == 0)) && !(1 == E_2)) && 2 <= m_st) && 2 <= t1_st) && 2 <= t2_st) && !(T1_E == 0)) && !(1 == T2_E)) && !(E_2 == 0))) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || !(m_i == 1)) || 1 == E_1) || 1 == \old(E_2)) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == \old(E_2)) || \old(t1_st) == 0)) && ((((((((((((((((((T1_E == 0 || T2_E == 1) || !(2 <= \old(m_st))) || (((((((1 == t1_pc && !(T2_E == 0)) && !(1 == E_2)) && 2 <= m_st) && 2 <= t1_st) && !(T1_E == 0)) && !(1 == T2_E)) && !(E_2 == 0))) || T2_E == 0) || 1 == M_E) || 1 == E_M) || !(m_i == 1)) || 1 == t2_pc) || 1 == E_1) || 1 == \old(E_2)) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == \old(E_2)) || \old(t1_st) == 0) || !(\old(t1_pc) <= 0))) && (((((((((((((((((((T1_E == 0 || !(2 <= \old(t2_st))) || T2_E == 1) || !(2 <= \old(m_st))) || ((((((((1 == t1_pc && !(T2_E == 0)) && !(1 == E_2)) && 2 <= m_st) && 2 <= t1_st) && 2 <= t2_st) && !(T1_E == 0)) && !(1 == T2_E)) && !(E_2 == 0))) || T2_E == 0) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || !(m_i == 1)) || 1 == E_1) || 1 == \old(E_2)) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == \old(E_2)) || \old(t1_st) == 0) || !(\old(t1_pc) <= 0)) - InvariantResult [Line: 83]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(\old(token) <= local)) || !(local <= \old(token))) || T2_E == 0) || 1 == M_E) || 1 == E_M) || !(0 == \old(m_st))) || !(m_i == 1)) || 1 == t2_pc) || 1 == E_1) || 1 == \old(E_2)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == \old(E_2)) || \old(t1_st) == 0) || !(\old(t1_pc) <= 0)) || 1 == m_pc) && (((((((((((((((((((((T1_E == 0 || !(2 <= \old(t2_st))) || T2_E == 1) || !(\old(token) <= local)) || !(\old(t1_pc) == 1)) || !(local <= \old(token))) || !(2 <= \old(m_st))) || T2_E == 0) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || !(m_i == 1)) || 1 == E_1) || 1 == \old(E_2)) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || ((((((1 == t1_pc && 2 <= m_st) && token <= local) && E_2 == \old(E_2)) && 2 <= t2_st) && \old(t1_st) == t1_st) && local <= token)) || !(1 == t2_i)) || 0 == E_M) || 0 == \old(E_2)) || \old(t1_st) == 0)) && (((((((((((((((((T1_E == 0 || !(2 <= \old(t2_st))) || T2_E == 1) || !(2 <= \old(m_st))) || T2_E == 0) || 1 == M_E) || 1 == E_M) || !(m_i == 1)) || 1 == E_1) || 1 == \old(E_2)) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == \old(E_2)) || \old(t1_st) == 0) || !(\old(t1_pc) <= 0))) && (((((((((((((((((((T1_E == 0 || !(2 <= \old(t2_st))) || T2_E == 1) || !(\old(token) <= local)) || !(local <= \old(token))) || T2_E == 0) || 1 == M_E) || 1 == E_M) || !(0 == \old(m_st))) || !(m_i == 1)) || 1 == E_1) || 1 == \old(E_2)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == \old(E_2)) || \old(t1_st) == 0) || !(\old(t1_pc) <= 0)) || 1 == m_pc)) && (((((((((((((((((((((1 == t1_pc && 2 <= m_st) && E_2 == \old(E_2)) && \old(t1_st) == t1_st) || T1_E == 0) || T2_E == 1) || !(\old(t1_pc) == 1)) || !(2 <= \old(m_st))) || T2_E == 0) || 1 == M_E) || 1 == E_M) || !(m_i == 1)) || 1 == t2_pc) || 1 == E_1) || 1 == \old(E_2)) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == \old(E_2)) || \old(t1_st) == 0)) && (((((((((((((((((T1_E == 0 || T2_E == 1) || !(2 <= \old(m_st))) || T2_E == 0) || 1 == M_E) || 1 == E_M) || !(m_i == 1)) || 1 == t2_pc) || 1 == E_1) || 1 == \old(E_2)) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == \old(E_2)) || \old(t1_st) == 0) || !(\old(t1_pc) <= 0)) - InvariantResult [Line: 39]: Loop Invariant Derived loop invariant: (((((((((((((((((((T1_E == 0 || !(2 <= \old(t2_st))) || T2_E == 1) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == E_M) || !(m_i == 1)) || 1 == \old(E_1)) || 1 == E_2) || 0 == \old(E_1)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || !(t1_pc <= 0)) || 1 == \old(m_pc)) && ((((((((((((((((((T1_E == 0 || !(2 <= \old(t2_st))) || T2_E == 1) || !(\old(token) <= \old(local))) || !(t1_pc == 1)) || !(\old(local) <= \old(token))) || T2_E == 0) || 1 == M_E) || 1 == E_M) || !(2 <= \old(t1_st))) || !(m_i == 1)) || 1 == \old(E_1)) || 1 == E_2) || 0 == \old(E_1)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == \old(m_pc))) && ((((((((((((((((T1_E == 0 || T2_E == 1) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == E_M) || !(m_i == 1)) || 1 == t2_pc) || 1 == \old(E_1)) || 1 == E_2) || 0 == \old(E_1)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || !(t1_pc <= 0)) || 1 == \old(m_pc))) && ((((((((((((((((((T1_E == 0 || T2_E == 1) || !(\old(token) <= \old(local))) || !(t1_pc == 1)) || !(\old(local) <= \old(token))) || T2_E == 0) || 1 == M_E) || 1 == E_M) || !(2 <= \old(t1_st))) || !(m_i == 1)) || 1 == t2_pc) || 1 == \old(E_1)) || 1 == E_2) || 0 == \old(E_1)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == \old(m_pc))) && ((((((((((((((((((((T1_E == 0 || ((((((\old(token) == token && E_1 == \old(E_1)) && token <= local + 2) && m_pc == 1) && 2 <= t2_st) && \old(t1_st) == t1_st) && local + 2 <= token)) || !(2 <= \old(t2_st))) || T2_E == 1) || !(\old(token) <= \old(local) + 2)) || !(t1_pc == 1)) || T2_E == 0) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || !(2 <= \old(t1_st))) || !(m_i == 1)) || 1 == \old(E_1)) || 1 == E_2) || !(1 == \old(m_pc))) || 0 == \old(E_1)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || !(\old(local) + 2 <= \old(token))) - InvariantResult [Line: 83]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((\old(t1_st) == t1_st && (((((t1_pc <= 0 && !(1 == E_2)) && m_st == 0) && 2 <= t2_st) && !(E_2 == 0)) || ((((1 == t1_pc && !(1 == E_2)) && m_st == 0) && 2 <= t2_st) && !(E_2 == 0)))) && \old(token) == token) || T1_E == 0) || !(2 <= \old(t2_st))) || T2_E == 1) || !(\old(token) <= local)) || !(local <= \old(token))) || T2_E == 0) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || !(0 == \old(m_st))) || !(m_i == 1)) || 1 == E_1) || 1 == \old(E_2)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == \old(E_2)) || \old(t1_st) == 0) || !(\old(t1_pc) <= 0)) || 1 == m_pc) && (((((((((((((((((((T1_E == 0 || !(2 <= \old(t2_st))) || T2_E == 1) || (\old(t1_st) == t1_st && ((1 == t1_pc && ((((!(1 == E_2) && 2 <= m_st) && 2 <= t2_st) && !(T1_E == 0)) && !(1 == T2_E)) && !(E_2 == 0)) || (t1_pc <= 0 && ((((!(1 == E_2) && 2 <= m_st) && 2 <= t2_st) && !(T1_E == 0)) && !(1 == T2_E)) && !(E_2 == 0))))) || !(2 <= \old(m_st))) || T2_E == 0) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || !(m_i == 1)) || 1 == E_1) || 1 == \old(E_2)) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == \old(E_2)) || \old(t1_st) == 0) || !(\old(t1_pc) <= 0))) && ((((((((((((((((((T1_E == 0 || T2_E == 1) || !(\old(t1_pc) == 1)) || (\old(t1_st) == t1_st && ((((((1 == t1_pc && !(1 == E_2)) && 2 <= m_st) && !(T1_E == 0)) && !(1 == T2_E)) && !(E_2 == 0)) || (((((t1_pc <= 0 && !(1 == E_2)) && 2 <= m_st) && !(T1_E == 0)) && !(1 == T2_E)) && !(E_2 == 0))))) || !(2 <= \old(m_st))) || T2_E == 0) || 1 == M_E) || 1 == E_M) || !(m_i == 1)) || 1 == t2_pc) || 1 == E_1) || 1 == \old(E_2)) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == \old(E_2)) || \old(t1_st) == 0)) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(\old(token) <= local)) || !(local <= \old(token))) || ((\old(t1_st) == t1_st && ((((1 == t1_pc && !(1 == E_2)) && m_st == 0) && !(E_2 == 0)) || (((t1_pc <= 0 && !(1 == E_2)) && m_st == 0) && !(E_2 == 0)))) && \old(token) == token)) || T2_E == 0) || 1 == M_E) || 1 == E_M) || !(0 == \old(m_st))) || !(m_i == 1)) || 1 == t2_pc) || 1 == E_1) || 1 == \old(E_2)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == \old(E_2)) || \old(t1_st) == 0) || !(\old(t1_pc) <= 0)) || 1 == m_pc)) && ((((((((((((((((((((((T1_E == 0 || !(2 <= \old(t2_st))) || T2_E == 1) || !(\old(token) <= local)) || ((((((1 == t1_pc && !(1 == E_2)) && 2 <= m_st) && token <= \old(token) + 1) && !(E_2 == 0)) && \old(t1_st) == t1_st) && local + 1 <= token)) || !(\old(t1_pc) == 1)) || !(local <= \old(token))) || (\old(t1_st) == t1_st && ((1 == t1_pc && ((((!(1 == E_2) && 2 <= m_st) && 2 <= t2_st) && !(T1_E == 0)) && !(1 == T2_E)) && !(E_2 == 0)) || (t1_pc <= 0 && ((((!(1 == E_2) && 2 <= m_st) && 2 <= t2_st) && !(T1_E == 0)) && !(1 == T2_E)) && !(E_2 == 0))))) || !(2 <= \old(m_st))) || T2_E == 0) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || !(m_i == 1)) || 1 == E_1) || 1 == \old(E_2)) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == \old(E_2)) || \old(t1_st) == 0)) && ((((((((((((((((((T1_E == 0 || T2_E == 1) || (\old(t1_st) == t1_st && ((((((1 == t1_pc && !(1 == E_2)) && 2 <= m_st) && !(T1_E == 0)) && !(1 == T2_E)) && !(E_2 == 0)) || (((((t1_pc <= 0 && !(1 == E_2)) && 2 <= m_st) && !(T1_E == 0)) && !(1 == T2_E)) && !(E_2 == 0))))) || !(2 <= \old(m_st))) || T2_E == 0) || 1 == M_E) || 1 == E_M) || !(m_i == 1)) || 1 == t2_pc) || 1 == E_1) || 1 == \old(E_2)) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == \old(E_2)) || \old(t1_st) == 0) || !(\old(t1_pc) <= 0)) - InvariantResult [Line: 528]: Loop Invariant Derived loop invariant: (((((((((((((((((((\old(T1_E) == 0 || \old(T2_E) == 1) || !(\old(token) <= \old(local))) || !(\old(local) <= \old(token))) || \old(T2_E) == 0) || 1 == \old(M_E)) || !(\old(t1_st) == 0)) || 1 == \old(E_M)) || !(T1_E == 0)) || !(0 == \old(m_st))) || !(m_i == 1)) || 1 == \old(t2_pc)) || 1 == \old(E_1)) || 1 == \old(E_2)) || 0 == \old(E_1)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 == \old(E_2)) || !(\old(t1_pc) <= 0)) || 1 == \old(m_pc) - InvariantResult [Line: 155]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T2_E == 0) || 1 == M_E) || !(t1_st == 0)) || 1 == E_M) || !(1 == E_1)) || !(m_i == 1)) || 1 == t2_pc) || 1 == E_2) || 0 == __retres1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || !(t1_pc <= 0)) || 1 == m_pc) && (((((((((((((((((T1_E == 0 || T2_E == 1) || !(t1_pc == 1)) || !(2 <= m_st)) || T2_E == 0) || 1 == M_E) || 1 == E_M) || !(m_i == 1)) || 1 == t2_pc) || 1 == E_1) || !(1 == m_pc)) || 0 == __retres1) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || t1_st == 0)) && ((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == __retres1) || !(t1_pc == 1)) || !(2 <= m_st)) || T2_E == 0) || 1 == E_M) || !(2 <= t1_st)) || !(local + 1 <= token)) || !(m_i == 1)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || !(token <= local + 1)) || 0 == E_M) || 0 == E_2)) && ((((((((((((((((T1_E == 0 || !(2 <= t2_st)) || T2_E == 1) || T2_E == 0) || 1 == M_E) || !(t1_st == 0)) || 1 == E_M) || !(1 == E_1)) || 0 == __retres1) || !(m_i == 1)) || 1 == E_2) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || !(t1_pc <= 0)) || 1 == m_pc)) && (((((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == __retres1) || !(token <= local + 2)) || !(t1_pc == 1)) || 1 == E_M) || !(2 <= m_st)) || T2_E == 0) || 1 == M_E) || !(2 <= t1_st)) || !(m_i == 1)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || !(local + 2 <= token))) && (((((((((((((((((((T1_E == 0 || !(2 <= t2_st)) || T2_E == 1) || !(t1_pc == 1)) || !(2 <= m_st)) || T2_E == 0) || 1 == M_E) || 1 == E_M) || !(local + 1 <= token)) || !(m_i == 1)) || 1 == E_1) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || !(token <= local + 1)) || 0 == E_M) || 0 == E_2) || t1_st == 0) || 0 == __retres1)) && (((((((((((((((((((T1_E == 0 || T2_E == 1) || !(token <= local)) || !(local <= token)) || 0 == __retres1) || T2_E == 0) || !(t1_st == 0)) || 1 == E_M) || !(0 == m_st)) || !(m_i == 1)) || 1 == t2_pc) || 1 == E_1) || 1 == E_2) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || !(t1_pc <= 0)) || 1 == m_pc)) && ((((((((((((((((((T1_E == 0 || T2_E == 1) || !(token <= local)) || !(t1_pc == 1)) || !(local <= token)) || T2_E == 0) || 1 == M_E) || 1 == E_M) || !(2 <= t1_st)) || !(1 == E_1)) || !(m_i == 1)) || 1 == t2_pc) || 1 == E_2) || 0 == __retres1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == m_pc)) && (((((((((((((((((T1_E == 0 || !(2 <= t2_st)) || T2_E == 1) || !(t1_pc == 1)) || !(2 <= m_st)) || T2_E == 0) || 1 == E_M) || !(2 <= t1_st)) || !(m_i == 1)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == __retres1) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2)) && (((((((((((((((((T1_E == 0 || T2_E == 1) || 0 == __retres1) || !(t1_pc == 1)) || !(2 <= m_st)) || T2_E == 0) || 1 == E_M) || !(2 <= t1_st)) || !(m_i == 1)) || 1 == t2_pc) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2)) && ((((((((((((((((((T1_E == 0 || !(2 <= t2_st)) || T2_E == 1) || !(token <= local)) || !(t1_pc == 1)) || !(local <= token)) || T2_E == 0) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || !(2 <= t1_st)) || !(1 == E_1)) || !(m_i == 1)) || 1 == E_2) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 0 == __retres1) - InvariantResult [Line: 39]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((T1_E == 0 || !(2 <= \old(t2_st))) || T2_E == 1) || !(\old(token) <= \old(local))) || !(t1_pc == 1)) || !(\old(local) <= \old(token))) || T2_E == 0) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || !(2 <= \old(t1_st))) || ((((((!(m_pc == 1) && \old(token) == token) && E_1 == \old(E_1)) && token <= local) && 2 <= t2_st) && \old(t1_st) == t1_st) && local <= token)) || !(m_i == 1)) || 1 == \old(E_1)) || 1 == E_2) || 0 == \old(E_1)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == \old(m_pc)) && ((((((((((((((((((((T1_E == 0 || ((((((\old(token) == token && E_1 == \old(E_1)) && token <= local + 2) && m_pc == 1) && 2 <= t2_st) && \old(t1_st) == t1_st) && local + 2 <= token)) || !(2 <= \old(t2_st))) || T2_E == 1) || !(\old(token) <= \old(local) + 2)) || !(t1_pc == 1)) || T2_E == 0) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || !(2 <= \old(t1_st))) || !(m_i == 1)) || 1 == \old(E_1)) || 1 == E_2) || !(1 == \old(m_pc))) || 0 == \old(E_1)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || !(\old(local) + 2 <= \old(token)))) && (((((((((((((((((((!(m_pc == 1) && \old(t1_st) == t1_st) && E_1 == \old(E_1)) || T1_E == 0) || T2_E == 1) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == E_M) || !(m_i == 1)) || 1 == t2_pc) || 1 == \old(E_1)) || 1 == E_2) || 0 == \old(E_1)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || !(t1_pc <= 0)) || 1 == \old(m_pc))) && ((((((((((((((((((((((((!(m_pc == 1) && \old(token) == token) && E_1 == \old(E_1)) && token <= local) && \old(t1_st) == t1_st) && local <= token) || T1_E == 0) || T2_E == 1) || !(\old(token) <= \old(local))) || !(t1_pc == 1)) || !(\old(local) <= \old(token))) || T2_E == 0) || 1 == M_E) || 1 == E_M) || !(2 <= \old(t1_st))) || !(m_i == 1)) || 1 == t2_pc) || 1 == \old(E_1)) || 1 == E_2) || 0 == \old(E_1)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == \old(m_pc))) && ((((((((((((((((((T1_E == 0 || !(2 <= \old(t2_st))) || T2_E == 1) || (((!(m_pc == 1) && E_1 == \old(E_1)) && 2 <= t2_st) && \old(t1_st) == t1_st)) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == E_M) || !(1 == t2_pc)) || !(m_i == 1)) || 1 == \old(E_1)) || 1 == E_2) || 0 == \old(E_1)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || !(t1_pc <= 0)) || 1 == \old(m_pc)) - InvariantResult [Line: 265]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(2 <= \old(m_st))) || T2_E == 0) || 1 == M_E) || !(2 <= \old(t1_st))) || !(\old(local) + 1 <= \old(token))) || 1 == \old(E_1)) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || ((((1 == t1_pc && token <= local + 1) && (!(1 == E_2) && ((((((m_pc == 1 && !(1 == T2_E)) && 1 == t2_pc) && 2 <= m_st) && (((!(T1_E == 0) && !(T2_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(E_2 == 0)) && t1_i == 1) && !(1 == M_E)) && !(E_M == 1)) && !(E_1 == 1)) && local + 1 <= token) && 2 <= t1_st)) || !(\old(t1_pc) == 1)) || (((2 <= t2_st && 1 == t1_pc) && (!(1 == E_2) && ((((((m_pc == 1 && !(1 == T2_E)) && 1 == t2_pc) && 2 <= m_st) && (((!(T1_E == 0) && !(T2_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(E_2 == 0)) && t1_i == 1) && !(1 == M_E)) && !(E_M == 1)) && !(E_1 == 1)) && 2 <= t1_st)) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || !(m_i == 1)) || !(1 == \old(m_pc))) || 0 == \old(E_1)) || !(1 == t2_i)) || !(\old(token) <= \old(local) + 1)) || 0 == \old(E_M)) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || ((((1 == t1_pc && token <= local + 1) && (!(1 == E_2) && ((((((m_pc == 1 && !(1 == T2_E)) && 1 == t2_pc) && 2 <= m_st) && (((!(T1_E == 0) && !(T2_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(E_2 == 0)) && t1_i == 1) && !(1 == M_E)) && !(E_M == 1)) && !(E_1 == 1)) && local + 1 <= token) && 2 <= t1_st)) || !(\old(token) <= \old(local))) || !(\old(local) <= \old(token))) || (((2 <= t2_st && 1 == t1_pc) && (!(1 == E_2) && ((((((m_pc == 1 && !(1 == T2_E)) && 1 == t2_pc) && 2 <= m_st) && (((!(T1_E == 0) && !(T2_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(E_2 == 0)) && t1_i == 1) && !(1 == M_E)) && !(E_M == 1)) && !(E_1 == 1)) && 2 <= t1_st)) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_M)) || ((1 == t1_pc && 2 <= t1_st) && (((((!(t2_pc == 1) && m_pc == 1) && !(1 == E_2)) && 2 <= m_st) && (((!(T1_E == 0) && !(T2_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(E_2 == 0)) && !(E_1 == 1)) && E_M == \old(E_M))) || !(0 == \old(m_st))) || !(m_i == 1)) || 1 == \old(t2_pc)) || 1 == \old(E_1)) || 1 == \old(E_2)) || 0 == \old(E_1)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 == \old(E_2)) || !(\old(t1_pc) <= 0)) || 1 == \old(m_pc))) && ((((((((((((((((((((((2 <= t2_st && 1 == t1_pc) && \old(t1_st) == t1_st) && (!(1 == E_2) && ((((((m_pc == 1 && !(1 == T2_E)) && 1 == t2_pc) && 2 <= m_st) && (((!(T1_E == 0) && !(T2_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(E_2 == 0)) && t1_i == 1) && !(1 == M_E)) && !(E_M == 1)) && E_1 == \old(E_1)) || T1_E == 0) || !(2 <= \old(t2_st))) || T2_E == 1) || !(\old(t1_pc) == 1)) || !(2 <= \old(m_st))) || T2_E == 0) || 1 == M_E) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || !(2 <= \old(t1_st))) || !(m_i == 1)) || 1 == \old(E_1)) || 1 == \old(E_2)) || !(1 == \old(m_pc))) || 0 == \old(E_1)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 == \old(E_2))) && ((((((((((((((((((((((2 <= t2_st && 1 == t1_pc) && \old(t1_st) == t1_st) && (!(1 == E_2) && ((((((m_pc == 1 && !(1 == T2_E)) && 1 == t2_pc) && 2 <= m_st) && (((!(T1_E == 0) && !(T2_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(E_2 == 0)) && t1_i == 1) && !(1 == M_E)) && !(E_M == 1)) && E_1 == \old(E_1)) || T1_E == 0) || T2_E == 1) || !(\old(t1_pc) == 1)) || !(2 <= \old(m_st))) || T2_E == 0) || 1 == M_E) || 1 == \old(E_M)) || !(2 <= \old(t1_st))) || !(m_i == 1)) || 1 == \old(t2_pc)) || 1 == \old(E_1)) || ((1 == t1_pc && \old(t1_st) == t1_st) && (((((!(t2_pc == 1) && m_pc == 1) && !(1 == E_2)) && 2 <= m_st) && (((!(T1_E == 0) && !(T2_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(E_2 == 0)) && E_1 == \old(E_1)) && E_M == \old(E_M))) || 1 == \old(E_2)) || !(1 == \old(m_pc))) || 0 == \old(E_1)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 == \old(E_2)) - InvariantResult [Line: 36]: Loop Invariant Derived loop invariant: (((((((((((((((((((((T1_E == 0 || !(2 <= \old(t2_st))) || T2_E == 1) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == E_M) || !(1 == t2_pc)) || !(m_i == 1)) || 1 == \old(E_1)) || 1 == E_2) || (((((2 <= m_st && m_pc == 1) && !(E_1 == 1)) && 2 <= t2_st) && \old(t1_st) == t1_st) && !(E_1 == 0))) || 0 == \old(E_1)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || !(t1_pc <= 0)) || 1 == \old(m_pc)) && (((((((((((((((((((((T1_E == 0 || !(2 <= \old(t2_st))) || T2_E == 1) || !(\old(token) <= \old(local) + 2)) || !(t1_pc == 1)) || T2_E == 0) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || !(2 <= \old(t1_st))) || !(m_i == 1)) || 1 == \old(E_1)) || 1 == E_2) || !(1 == \old(m_pc))) || ((((((((((((((((1 == t1_pc && !(T2_E == 0)) && !(1 == E_2)) && 2 <= m_st) && !(1 == T2_E)) && 1 == m_i) && token <= local) && !(1 == M_E)) && !(E_M == 1)) && m_pc == 1) && 1 == t2_pc) && 0 == t1_st) && !(E_1 == 1)) && 2 <= t2_st) && !(T1_E == 0)) && !(E_1 == 0)) && local <= token)) || 0 == \old(E_1)) || ((((((((((((((((1 == t1_pc && !(T2_E == 0)) && !(1 == E_2)) && 2 <= m_st) && 2 <= t1_st) && !(1 == T2_E)) && 1 == m_i) && !(1 == M_E)) && !(E_M == 1)) && m_pc == 1) && 1 == t2_pc) && t1_i == 1) && !(E_1 == 1)) && 2 <= t2_st) && !(T1_E == 0)) && \old(t1_st) == t1_st) && !(E_1 == 0))) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || !(\old(local) + 2 <= \old(token)))) && (((((((((((((((((T1_E == 0 || T2_E == 1) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == E_M) || !(m_i == 1)) || 1 == t2_pc) || 1 == \old(E_1)) || 1 == E_2) || ((((m_pc == 1 && 2 <= m_st) && !(E_1 == 1)) && \old(t1_st) == t1_st) && !(E_1 == 0))) || 0 == \old(E_1)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || !(t1_pc <= 0)) || 1 == \old(m_pc))) && (((((((((((((((((((((T1_E == 0 || !(2 <= \old(t2_st))) || T2_E == 1) || !(\old(token) <= \old(local))) || !(t1_pc == 1)) || !(\old(local) <= \old(token))) || T2_E == 0) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || !(2 <= \old(t1_st))) || !(m_i == 1)) || 1 == \old(E_1)) || 1 == E_2) || ((((((((((((((((1 == t1_pc && !(T2_E == 0)) && !(1 == E_2)) && 2 <= m_st) && !(1 == T2_E)) && 1 == m_i) && token <= local) && !(1 == M_E)) && !(E_M == 1)) && m_pc == 1) && 1 == t2_pc) && 0 == t1_st) && !(E_1 == 1)) && 2 <= t2_st) && !(T1_E == 0)) && !(E_1 == 0)) && local <= token)) || 0 == \old(E_1)) || !(1 == t1_i)) || ((((((((((((((((1 == t1_pc && !(T2_E == 0)) && !(1 == E_2)) && 2 <= m_st) && 2 <= t1_st) && !(1 == T2_E)) && 1 == m_i) && !(1 == M_E)) && !(E_M == 1)) && m_pc == 1) && 1 == t2_pc) && t1_i == 1) && !(E_1 == 1)) && 2 <= t2_st) && !(T1_E == 0)) && \old(t1_st) == t1_st) && !(E_1 == 0))) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == \old(m_pc))) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(\old(token) <= \old(local))) || !(t1_pc == 1)) || !(\old(local) <= \old(token))) || T2_E == 0) || 1 == M_E) || 1 == E_M) || !(2 <= \old(t1_st))) || ((((((2 <= m_st && token <= local) && m_pc == 1) && 0 == t1_st) && !(E_1 == 1)) && !(E_1 == 0)) && local <= token)) || !(m_i == 1)) || 1 == t2_pc) || 1 == \old(E_1)) || 1 == E_2) || ((((m_pc == 1 && 2 <= m_st) && !(E_1 == 1)) && \old(t1_st) == t1_st) && !(E_1 == 0))) || 0 == \old(E_1)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == \old(m_pc)) - InvariantResult [Line: 174]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || T2_E == 0) || 1 == M_E) || !(t1_st == 0)) || 1 == E_M) || !(1 == E_1)) || __retres1 == 0) || !(m_i == 1)) || 1 == t2_pc) || 1 == E_2) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || !(t1_pc <= 0)) || 1 == m_pc) && (((((((((((((((((T1_E == 0 || T2_E == 1) || !(t1_pc == 1)) || !(2 <= m_st)) || T2_E == 0) || 1 == E_M) || !(2 <= t1_st)) || !(m_i == 1)) || 1 == t2_pc) || 1 == E_1) || __retres1 == 0) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2)) && (((((((((((((((((__retres1 == 0 || T1_E == 0) || !(2 <= t2_st)) || T2_E == 1) || !(t1_pc == 1)) || !(2 <= m_st)) || T2_E == 0) || 1 == E_M) || !(2 <= t1_st)) || !(m_i == 1)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2)) && ((((((((((((((((((T1_E == 0 || T2_E == 1) || !(t1_pc == 1)) || __retres1 == 0) || !(2 <= m_st)) || T2_E == 0) || 1 == E_M) || !(2 <= t1_st)) || !(local + 1 <= token)) || !(m_i == 1)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || !(token <= local + 1)) || 0 == E_M) || 0 == E_2)) && (((((((((((((((((T1_E == 0 || T2_E == 1) || !(t1_pc == 1)) || !(2 <= m_st)) || T2_E == 0) || 1 == M_E) || 1 == E_M) || !(m_i == 1)) || 1 == t2_pc) || 1 == E_1) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || t1_st == 0) || __retres1 == 0)) && ((((((((((((((((T1_E == 0 || !(2 <= t2_st)) || T2_E == 1) || T2_E == 0) || 1 == M_E) || !(t1_st == 0)) || 1 == E_M) || !(1 == E_1)) || __retres1 == 0) || !(m_i == 1)) || 1 == E_2) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || !(t1_pc <= 0)) || 1 == m_pc)) && (((((((((((((((((((T1_E == 0 || T2_E == 1) || !(token <= local)) || !(local <= token)) || T2_E == 0) || !(t1_st == 0)) || 1 == E_M) || !(0 == m_st)) || !(m_i == 1)) || 1 == t2_pc) || 1 == E_1) || 1 == E_2) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || __retres1 == 0) || !(t1_pc <= 0)) || 1 == m_pc)) && (((((((((((((((((!(1 == E_M) || T1_E == 0) || T2_E == 1) || !(t1_pc == 1)) || !(2 <= m_st)) || T2_E == 0) || 1 == M_E) || !(1 == t2_pc)) || !(2 <= t1_st)) || !(m_i == 1)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_2) || __retres1 == 0)) && (((((((((((((((((((T1_E == 0 || !(2 <= t2_st)) || T2_E == 1) || !(t1_pc == 1)) || !(2 <= m_st)) || T2_E == 0) || 1 == M_E) || 1 == E_M) || !(local + 1 <= token)) || !(m_i == 1)) || 1 == E_1) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || !(token <= local + 1)) || 0 == E_M) || 0 == E_2) || t1_st == 0) || __retres1 == 0)) && (((((((((((((((((((!(1 == E_M) || T1_E == 0) || T2_E == 1) || !(token <= local + 2)) || !(t1_pc == 1)) || T2_E == 0) || 1 == M_E) || !(1 == t2_pc)) || !(2 <= t1_st)) || !(0 == m_st)) || __retres1 == 0) || !(m_i == 1)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_2) || !(local + 2 <= token)) - InvariantResult [Line: 243]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(token <= local)) || !(t1_pc == 1)) || !(local <= token)) || !(2 <= m_st)) || T2_E == 0) || 1 == M_E) || !(t1_st == 0)) || 1 == E_M) || !(m_i == 1)) || 1 == t2_pc) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || __retres1 == 1) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) && ((((((((((((((((((T1_E == 0 || __retres1 == 1) || T2_E == 1) || !(2 <= m_st)) || T2_E == 0) || 1 == M_E) || !(t1_st == 0)) || 1 == E_M) || !(m_i == 1)) || 1 == t2_pc) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || !(t1_pc <= 0))) && (((((((((((((((((((((T1_E == 0 || !(2 <= t2_st)) || T2_E == 1) || !(token <= local + 2)) || !(t1_pc == 1)) || T2_E == 0) || __retres1 == 1) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || !(2 <= t1_st)) || !(0 == m_st)) || !(m_i == 1)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || !(local + 2 <= token))) && ((((((((((((((((((T1_E == 0 || !(2 <= t2_st)) || __retres1 == 1) || T2_E == 1) || !(2 <= m_st)) || T2_E == 0) || 1 == M_E) || !(t1_st == 0)) || 1 == E_M) || !(m_i == 1)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || !(t1_pc <= 0))) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(token <= local)) || !(t1_pc == 1)) || !(local <= token)) || T2_E == 0) || 1 == M_E) || 1 == E_M) || !(2 <= t1_st)) || !(0 == m_st)) || !(m_i == 1)) || 1 == t2_pc) || 1 == E_1) || 1 == E_2) || __retres1 == 1) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == m_pc)) && ((((((((((((((((((((T1_E == 0 || !(2 <= t2_st)) || T2_E == 1) || !(token <= local)) || !(t1_pc == 1)) || !(local <= token)) || __retres1 == 1) || !(2 <= m_st)) || T2_E == 0) || 1 == M_E) || !(t1_st == 0)) || 1 == E_M) || !(m_i == 1)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2)) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(token <= local)) || !(local <= token)) || __retres1 == 1) || T2_E == 0) || 1 == M_E) || !(t1_st == 0)) || 1 == E_M) || !(0 == m_st)) || !(m_i == 1)) || 1 == t2_pc) || 1 == E_1) || 1 == E_2) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || !(t1_pc <= 0)) || 1 == m_pc)) && ((((((((((((((((((((T1_E == 0 || !(2 <= t2_st)) || T2_E == 1) || !(token <= local)) || !(t1_pc == 1)) || !(local <= token)) || __retres1 == 1) || T2_E == 0) || 1 == M_E) || 1 == E_M) || !(2 <= t1_st)) || !(0 == m_st)) || !(m_i == 1)) || 1 == E_1) || 1 == E_2) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || 1 == m_pc)) && ((((((((((((((((((((T1_E == 0 || !(2 <= t2_st)) || T2_E == 1) || !(token <= local)) || !(local <= token)) || T2_E == 0) || 1 == M_E) || !(t1_st == 0)) || 1 == E_M) || !(0 == m_st)) || !(m_i == 1)) || 1 == E_1) || 1 == E_2) || 0 == E_1) || __retres1 == 1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || 0 == E_2) || !(t1_pc <= 0)) || 1 == m_pc) - InvariantResult [Line: 116]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || ((((2 <= m_st && 1 == t2_pc) && 2 <= t2_st) && \old(t1_st) == t1_st) && E_M == \old(E_M))) || !(2 <= \old(m_st))) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_M)) || !(m_i == 1)) || 1 == \old(t2_pc)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 == E_2) || !(t1_pc <= 0)) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(\old(token) <= local)) || !(t1_pc == 1)) || !(local <= \old(token))) || !(2 <= \old(m_st))) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_M)) || !(m_i == 1)) || 1 == \old(t2_pc)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || ((((((2 <= m_st && token <= local) && 1 == t2_pc) && 2 <= t2_st) && \old(t1_st) == t1_st) && E_M == \old(E_M)) && local <= token)) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 == E_2)) && ((((((((((((((((((((T1_E == 0 || ((((((m_st == 0 && token <= local) && 1 == t2_pc) && 2 <= t2_st) && \old(t1_st) == t1_st) && E_M == \old(E_M)) && local <= token)) || T2_E == 1) || !(\old(token) <= local)) || !(local <= \old(token))) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_M)) || !(0 == \old(m_st))) || !(m_i == 1)) || 1 == \old(t2_pc)) || 1 == E_1) || 1 == E_2) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 == E_2) || !(t1_pc <= 0)) || 1 == m_pc)) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || (((((((m_st == 0 && !(E_M == 0)) && !(E_M == 1)) && token <= local + 2) && 1 == t2_pc) && 2 <= t2_st) && \old(t1_st) == t1_st) && local + 2 <= token)) || !(t1_pc == 1)) || !(2 <= \old(m_st))) || T2_E == 0) || 1 == M_E) || 1 == \old(E_M)) || !(2 <= \old(t1_st))) || !(local + 1 <= \old(token))) || !(m_i == 1)) || 1 == E_1) || (((((2 <= m_st && !(E_M == 0)) && !(E_M == 1)) && 1 == t2_pc) && 2 <= t2_st) && \old(t1_st) == t1_st)) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || !(\old(token) <= local + 1)) || 0 == \old(E_M)) || 0 == E_2)) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(\old(token) <= local)) || !(t1_pc == 1)) || !(local <= \old(token))) || T2_E == 0) || 1 == M_E) || 1 == \old(E_M)) || !(2 <= \old(t1_st))) || !(0 == \old(m_st))) || !(m_i == 1)) || 1 == \old(t2_pc)) || 1 == E_1) || 1 == E_2) || ((((((m_st == 0 && token <= local) && 1 == t2_pc) && 2 <= t2_st) && \old(t1_st) == t1_st) && E_M == \old(E_M)) && local <= token)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 == E_2) || 1 == m_pc)) && ((((((((((((((((((T1_E == 0 || T2_E == 1) || !(t1_pc == 1)) || !(2 <= \old(m_st))) || T2_E == 0) || ((((2 <= m_st && 1 == t2_pc) && 2 <= t2_st) && \old(t1_st) == t1_st) && E_M == \old(E_M))) || 1 == M_E) || 1 == \old(E_M)) || !(2 <= \old(t1_st))) || !(m_i == 1)) || 1 == \old(t2_pc)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 == E_2) - InvariantResult [Line: 119]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(\old(token) <= local)) || !(t1_pc == 1)) || !(local <= \old(token))) || !(2 <= \old(m_st))) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_M)) || !(m_i == 1)) || 1 == \old(t2_pc)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 == E_2) && (((((((((((((((((((T1_E == 0 || T2_E == 1) || !(\old(token) <= local)) || !(local <= \old(token))) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_M)) || !(0 == \old(m_st))) || !(m_i == 1)) || 1 == \old(t2_pc)) || 1 == E_1) || 1 == E_2) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 == E_2) || !(t1_pc <= 0)) || 1 == m_pc)) && (((((((((((((((((T1_E == 0 || T2_E == 1) || !(t1_pc == 1)) || !(2 <= \old(m_st))) || T2_E == 0) || 1 == M_E) || 1 == \old(E_M)) || !(2 <= \old(t1_st))) || !(m_i == 1)) || 1 == \old(t2_pc)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 == E_2)) && (((((((((((((((((((T1_E == 0 || T2_E == 1) || !(\old(token) <= local)) || !(t1_pc == 1)) || !(local <= \old(token))) || T2_E == 0) || 1 == M_E) || 1 == \old(E_M)) || !(2 <= \old(t1_st))) || !(0 == \old(m_st))) || !(m_i == 1)) || 1 == \old(t2_pc)) || 1 == E_1) || 1 == E_2) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 == E_2) || 1 == m_pc)) && (((((((((((((((((((T1_E == 0 || T2_E == 1) || !(t1_pc == 1)) || !(2 <= \old(m_st))) || T2_E == 0) || 1 == M_E) || 1 == \old(E_M)) || !(2 <= \old(t1_st))) || !(local + 1 <= \old(token))) || !(m_i == 1)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || ((((2 <= m_st && \old(token) == token) && 1 == t2_pc) && \old(t1_st) == t1_st) && E_M == \old(E_M))) || !(1 == t2_i)) || !(\old(token) <= local + 1)) || 0 == \old(E_M)) || 0 == E_2)) && (((((((((((((((((T1_E == 0 || T2_E == 1) || !(2 <= \old(m_st))) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_M)) || !(m_i == 1)) || 1 == \old(t2_pc)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 == E_2) || !(t1_pc <= 0)) - InvariantResult [Line: 271]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(\old(token) <= \old(local))) || T2_E == 0) || (((1 == t1_pc && !(tmp == 0)) && ((((((((!(t2_pc == 1) && m_pc == 1) && !(1 == E_2)) && 2 <= m_st) && (((!(T1_E == 0) && !(T2_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(E_2 == 0)) && t1_i == 1) && !(E_1 == 1)) && !(1 == T2_E)) && !(1 == M_E)) && E_M == \old(E_M)) && 2 <= t1_st)) || (((t1_pc <= 0 && 0 == t1_st) && tmp == 1) && ((((((((!(t2_pc == 1) && m_pc == 1) && !(1 == E_2)) && 2 <= m_st) && (((!(T1_E == 0) && !(T2_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(E_2 == 0)) && t1_i == 1) && !(E_1 == 1)) && !(1 == T2_E)) && !(1 == M_E)) && E_M == \old(E_M))) || 1 == M_E) || !(\old(t1_st) == 0)) || ((((2 <= t2_st && 1 == t1_pc) && (!(1 == E_2) && (((((((m_pc == 1 && !(1 == T2_E)) && 1 == t2_pc) && 1 == m_i) && 2 <= m_st) && (((!(T1_E == 0) && !(T2_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(E_2 == 0)) && t1_i == 1) && !(1 == M_E)) && !(E_M == 1)) && !(E_1 == 1)) && !(tmp == 0)) && 2 <= t1_st)) || 1 == \old(t2_pc)) || 1 == \old(E_1)) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || ((token <= local && ((2 <= t2_st && 1 == t1_pc) && (!(1 == E_2) && (((((((m_pc == 1 && !(1 == T2_E)) && 1 == t2_pc) && 2 <= m_st) && (((!(T1_E == 0) && !(T2_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(E_2 == 0)) && t1_i == 1) && 0 == t1_st) && !(1 == M_E)) && !(E_M == 1)) && !(E_1 == 1)) && !(tmp == 0)) && local <= token)) || (((2 <= t2_st && t1_pc <= 0) && (!(1 == E_2) && (((((((m_pc == 1 && !(1 == T2_E)) && 1 == t2_pc) && 2 <= m_st) && (((!(T1_E == 0) && !(T2_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(E_2 == 0)) && t1_i == 1) && 0 == t1_st) && !(1 == M_E)) && !(E_M == 1)) && !(E_1 == 1)) && tmp == 1)) || (((((t1_pc <= 0 && token <= local) && 0 == t1_st) && (((((((((!(t2_pc == 1) && !(1 == E_2)) && m_st == 0) && (((!(T1_E == 0) && !(T2_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(E_2 == 0)) && t1_i == 1) && !(E_1 == 1)) && !(m_pc == 1)) && !(1 == T2_E)) && E_1 == \old(E_1)) && !(1 == M_E)) && E_M == \old(E_M)) && local <= token) && \old(token) == token)) || (((((((2 <= t2_st && 1 == t1_pc) && m_st == 0) && (!(1 == E_2) && (((((m_pc == 1 && !(1 == T2_E)) && 1 == t2_pc) && (((!(T1_E == 0) && !(T2_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(E_2 == 0)) && t1_i == 1) && !(1 == M_E)) && !(E_M == 1)) && !(E_1 == 1)) && !(tmp == 0)) && 2 <= t1_st) && local + 2 <= token) && token <= local + 2)) || !(\old(local) <= \old(token))) || (((token <= local && (1 == t1_pc && !(tmp == 0)) && ((((((((!(t2_pc == 1) && m_pc == 1) && !(1 == E_2)) && 2 <= m_st) && (((!(T1_E == 0) && !(T2_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(E_2 == 0)) && t1_i == 1) && !(E_1 == 1)) && !(1 == T2_E)) && !(1 == M_E)) && E_M == \old(E_M)) && 0 == t1_st) && local <= token)) || ((((((1 == t1_pc && token <= local) && 2 <= t1_st) && (((((((((!(t2_pc == 1) && !(1 == E_2)) && m_st == 0) && (((!(T1_E == 0) && !(T2_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(E_2 == 0)) && t1_i == 1) && !(E_1 == 1)) && !(m_pc == 1)) && !(1 == T2_E)) && E_1 == \old(E_1)) && !(1 == M_E)) && E_M == \old(E_M)) && tmp == 1) && local <= token) && \old(token) == token)) || ((((((((2 <= t2_st && ((!(1 == E_2) && ((((((!(1 == T2_E) && 1 == t2_pc) && 1 == m_i) && (((!(T1_E == 0) && !(T2_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(E_2 == 0)) && t1_i == 1) && !(1 == M_E)) && !(m_pc == 1)) && !(E_M == 1)) && E_1 == \old(E_1)) && !(E_1 == 1)) && 1 == t1_pc) && m_st == 0) && token <= local) && 2 <= t1_st) && tmp == 1) && local <= token) && \old(token) == token)) || 1 == \old(E_M)) || !(0 == \old(m_st))) || !(m_i == 1)) || ((((((((2 <= t2_st && ((!(1 == E_2) && ((((((!(1 == T2_E) && 1 == t2_pc) && 1 == m_i) && (((!(T1_E == 0) && !(T2_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(E_2 == 0)) && t1_i == 1) && !(1 == M_E)) && !(m_pc == 1)) && !(E_M == 1)) && E_1 == \old(E_1)) && !(E_1 == 1)) && t1_pc <= 0) && m_st == 0) && token <= local) && 0 == t1_st) && tmp == 1) && local <= token) && \old(token) == token)) || 0 == \old(E_1)) || !(1 == t2_i)) || 0 == \old(E_M)) || !(\old(t1_pc) <= 0)) || ((((((((!(1 == E_2) && (((((((m_pc == 1 && !(1 == T2_E)) && 1 == t2_pc) && 1 == m_i) && 2 <= m_st) && (((!(T1_E == 0) && !(T2_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(E_2 == 0)) && t1_i == 1) && !(1 == M_E)) && !(E_M == 1)) && !(E_1 == 1)) && t2_i == 1) && !(tmp == 0)) && 1 == t1_pc) && token <= local + 1) && local + 1 <= token) && 2 <= t1_st)) || 1 == \old(m_pc)) && (((((((((((((((((((T1_E == 0 || T2_E == 1) || !(\old(t1_pc) == 1)) || !(2 <= \old(m_st))) || T2_E == 0) || ((1 == t1_pc && (((((!(t2_pc == 1) && m_pc == 1) && !(1 == E_2)) && 2 <= m_st) && (((!(T1_E == 0) && !(T2_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(E_2 == 0)) && E_1 == \old(E_1)) && E_M == \old(E_M)) && \old(t1_st) == t1_st)) || 1 == M_E) || 1 == \old(E_M)) || !(2 <= \old(t1_st))) || !(m_i == 1)) || 1 == \old(t2_pc)) || 1 == \old(E_1)) || 1 == \old(E_2)) || !(1 == \old(m_pc))) || 0 == \old(E_1)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 == \old(E_2)) || ((\old(t1_st) == t1_st && 2 <= t1_st) && ((2 <= t2_st && 1 == t1_pc) && ((!(1 == E_2) && (((((((m_pc == 1 && !(1 == T2_E)) && 1 == t2_pc) && 1 == m_i) && 2 <= m_st) && (((!(T1_E == 0) && !(T2_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(E_2 == 0)) && t1_i == 1) && !(1 == M_E)) && !(E_M == 1)) && E_1 == \old(E_1)) && !(E_1 == 1)) && t2_i == 1))) && (((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(2 <= \old(m_st))) || T2_E == 0) || 1 == M_E) || !(2 <= \old(t1_st))) || ((((2 <= t2_st && 1 == t1_pc) && (!(1 == E_2) && (((((((m_pc == 1 && !(1 == T2_E)) && 1 == t2_pc) && 1 == m_i) && 2 <= m_st) && (((!(T1_E == 0) && !(T2_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(E_2 == 0)) && t1_i == 1) && !(1 == M_E)) && !(E_M == 1)) && !(E_1 == 1)) && !(tmp == 0)) && 2 <= t1_st)) || !(\old(local) + 1 <= \old(token))) || 1 == \old(E_1)) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || (((((((2 <= t2_st && 1 == t1_pc) && m_st == 0) && (!(1 == E_2) && (((((m_pc == 1 && !(1 == T2_E)) && 1 == t2_pc) && (((!(T1_E == 0) && !(T2_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(E_2 == 0)) && t1_i == 1) && !(1 == M_E)) && !(E_M == 1)) && !(E_1 == 1)) && !(tmp == 0)) && 2 <= t1_st) && local + 2 <= token) && token <= local + 2)) || !(\old(t1_pc) == 1)) || ((((token <= local + 1 && \old(t1_st) == t1_st) && local + 1 <= token) && 1 == t1_pc && ((!(1 == E_2) && (((((((m_pc == 1 && !(1 == T2_E)) && 1 == t2_pc) && 1 == m_i) && 2 <= m_st) && (((!(T1_E == 0) && !(T2_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(E_2 == 0)) && t1_i == 1) && !(1 == M_E)) && !(E_M == 1)) && E_1 == \old(E_1)) && !(E_1 == 1)) && \old(token) == token)) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || !(m_i == 1)) || !(1 == \old(m_pc))) || (((token <= local && 0 == t1_st) && ((2 <= t2_st && 1 == t1_pc) && (!(1 == E_2) && (((((((m_pc == 1 && !(1 == T2_E)) && 1 == t2_pc) && 1 == m_i) && 2 <= m_st) && (((!(T1_E == 0) && !(T2_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(E_2 == 0)) && t1_i == 1) && !(1 == M_E)) && !(E_M == 1)) && !(E_1 == 1)) && !(tmp == 0)) && local <= token)) || 0 == \old(E_1)) || !(1 == t2_i)) || !(\old(token) <= \old(local) + 1)) || 0 == \old(E_M)) || ((\old(t1_st) == t1_st && 2 <= t1_st) && ((2 <= t2_st && 1 == t1_pc) && ((!(1 == E_2) && (((((((m_pc == 1 && !(1 == T2_E)) && 1 == t2_pc) && 1 == m_i) && 2 <= m_st) && (((!(T1_E == 0) && !(T2_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(E_2 == 0)) && t1_i == 1) && !(1 == M_E)) && !(E_M == 1)) && E_1 == \old(E_1)) && !(E_1 == 1)) && t2_i == 1)) || ((((((((!(1 == E_2) && (((((((m_pc == 1 && !(1 == T2_E)) && 1 == t2_pc) && 1 == m_i) && 2 <= m_st) && (((!(T1_E == 0) && !(T2_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(E_2 == 0)) && t1_i == 1) && !(1 == M_E)) && !(E_M == 1)) && !(E_1 == 1)) && t2_i == 1) && !(tmp == 0)) && 1 == t1_pc) && token <= local + 1) && local + 1 <= token) && 2 <= t1_st))) && (((((((((((((((((((T1_E == 0 || !(2 <= \old(t2_st))) || T2_E == 1) || !(\old(t1_pc) == 1)) || !(2 <= \old(m_st))) || T2_E == 0) || 1 == M_E) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || !(2 <= \old(t1_st))) || !(m_i == 1)) || 1 == \old(E_1)) || 1 == \old(E_2)) || !(1 == \old(m_pc))) || 0 == \old(E_1)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 == \old(E_2)) || ((\old(t1_st) == t1_st && 2 <= t1_st) && ((2 <= t2_st && 1 == t1_pc) && ((!(1 == E_2) && (((((((m_pc == 1 && !(1 == T2_E)) && 1 == t2_pc) && 1 == m_i) && 2 <= m_st) && (((!(T1_E == 0) && !(T2_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(E_2 == 0)) && t1_i == 1) && !(1 == M_E)) && !(E_M == 1)) && E_1 == \old(E_1)) && !(E_1 == 1)) && t2_i == 1)) - InvariantResult [Line: 540]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((\old(T1_E) == 0 || \old(T2_E) == 1) || !(\old(token) <= \old(local))) || ((token <= local + 1 && local + 1 <= token) && (1 == t1_pc && (!(1 == E_2) && ((\old(T2_E) == T2_E && !(1 == T2_E)) && ((((((((m_pc == 1 && !(T1_E == 0)) && 1 == t2_pc) && !(T2_E == 0)) && 2 <= m_st) && t1_i == 1) && !(E_1 == 0)) && !(E_M == 0)) && !(1 == M_E)) && !(E_2 == 0)) && !(E_M == 1)) && !(E_1 == 1)) && 2 <= t1_st)) || \old(T2_E) == 0) || 1 == \old(M_E)) || !(\old(t1_st) == 0)) || 1 == \old(t2_pc)) || 1 == \old(E_1)) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || ((((((((((((((!(t2_pc == 1) && t1_pc <= 0) && !(1 == E_2)) && m_st == 0) && !(m_pc == 1)) && \old(token) == token) && \old(T2_E) == T2_E) && E_1 == \old(E_1)) && token <= local) && !(1 == M_E)) && !(E_2 == 0)) && !(T1_E == 0)) && \old(t1_st) == t1_st) && E_M == \old(E_M)) && local <= token)) || ((1 == t1_pc && (((\old(T2_E) == T2_E && !(1 == E_2)) && (((((!(t2_pc == 1) && m_pc == 1) && !(T1_E == 0)) && 2 <= m_st) && !(E_1 == 0)) && !(1 == M_E)) && !(E_2 == 0)) && !(E_1 == 1)) && E_M == \old(E_M)) && 2 <= t1_st)) || !(\old(local) <= \old(token))) || 1 == \old(E_M)) || !(0 == \old(m_st))) || (((2 <= t2_st && 1 == t1_pc) && (!(1 == E_2) && ((\old(T2_E) == T2_E && !(1 == T2_E)) && ((((((((m_pc == 1 && !(T1_E == 0)) && 1 == t2_pc) && !(T2_E == 0)) && 2 <= m_st) && t1_i == 1) && !(E_1 == 0)) && !(E_M == 0)) && !(1 == M_E)) && !(E_2 == 0)) && !(E_M == 1)) && !(E_1 == 1)) && 2 <= t1_st)) || !(m_i == 1)) || 0 == \old(E_1)) || !(1 == t2_i)) || 0 == \old(E_M)) || !(\old(t1_pc) <= 0)) || 1 == \old(m_pc) - StatisticsResult: Ultimate Automizer benchmark data CFG has 23 procedures, 174 locations, 1 error locations. SAFE Result, 86.4s OverallTime, 24 OverallIterations, 6 TraceHistogramMax, 12.4s AutomataDifference, 0.0s DeadEndRemovalTime, 63.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 6382 SDtfs, 7300 SDslu, 8813 SDs, 0 SdLazy, 4918 SolverSat, 1819 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2253 GetRequests, 2115 SyntacticMatches, 15 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4680occurred in iteration=18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 4.1s AutomataMinimizationTime, 24 MinimizatonAttempts, 1947 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 71 LocationsWithAnnotation, 15100 PreInvPairs, 15443 NumberOfFragments, 26999 HoareAnnotationTreeSize, 15100 FomulaSimplifications, 240310 FormulaSimplificationTreeSizeReduction, 4.7s HoareSimplificationTime, 71 FomulaSimplificationsInter, 155104 FormulaSimplificationTreeSizeReductionInter, 58.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 6401 NumberOfCodeBlocks, 6401 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 6368 ConstructedInterpolants, 0 QuantifiedInterpolants, 1688386 SizeOfPredicates, 4 NumberOfNonLiveVariables, 8637 ConjunctsInSsa, 35 ConjunctsInUnsatCore, 33 InterpolantComputations, 24 PerfectInterpolantSequences, 4234/4355 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...