./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/systemc/token_ring.01.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a4ecdabc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_9e8d23e1-c20e-44c6-8fc2-3dd2dd4e6337/bin/uautomizer/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_9e8d23e1-c20e-44c6-8fc2-3dd2dd4e6337/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_9e8d23e1-c20e-44c6-8fc2-3dd2dd4e6337/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_9e8d23e1-c20e-44c6-8fc2-3dd2dd4e6337/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/systemc/token_ring.01.cil-1.c -s /tmp/vcloud-vcloud-master/worker/run_dir_9e8d23e1-c20e-44c6-8fc2-3dd2dd4e6337/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_9e8d23e1-c20e-44c6-8fc2-3dd2dd4e6337/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6325feb12f40756470caf3b12878fd0ec9ad6f61 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.0-a4ecdab [2020-11-28 03:05:24,910 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-28 03:05:24,913 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-28 03:05:24,971 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-28 03:05:24,972 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-28 03:05:24,977 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-28 03:05:24,980 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-28 03:05:24,984 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-28 03:05:24,987 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-28 03:05:24,993 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-28 03:05:24,994 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-28 03:05:24,997 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-28 03:05:24,997 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-28 03:05:25,001 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-28 03:05:25,003 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-28 03:05:25,005 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-28 03:05:25,006 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-28 03:05:25,010 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-28 03:05:25,013 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-28 03:05:25,021 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-28 03:05:25,023 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-28 03:05:25,024 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-28 03:05:25,027 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-28 03:05:25,028 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-28 03:05:25,037 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-28 03:05:25,037 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-28 03:05:25,038 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-28 03:05:25,040 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-28 03:05:25,041 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-28 03:05:25,042 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-28 03:05:25,043 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-28 03:05:25,044 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-28 03:05:25,046 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-28 03:05:25,047 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-28 03:05:25,049 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-28 03:05:25,049 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-28 03:05:25,050 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-28 03:05:25,050 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-28 03:05:25,051 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-28 03:05:25,052 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-28 03:05:25,053 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-28 03:05:25,056 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_9e8d23e1-c20e-44c6-8fc2-3dd2dd4e6337/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-11-28 03:05:25,093 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-28 03:05:25,094 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-28 03:05:25,096 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-28 03:05:25,096 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-28 03:05:25,096 INFO L138 SettingsManager]: * Use SBE=true [2020-11-28 03:05:25,096 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-28 03:05:25,097 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-28 03:05:25,097 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-28 03:05:25,097 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-28 03:05:25,097 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-28 03:05:25,099 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-28 03:05:25,099 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-28 03:05:25,099 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-28 03:05:25,099 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-28 03:05:25,100 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-28 03:05:25,100 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-28 03:05:25,100 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-28 03:05:25,100 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-28 03:05:25,101 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-28 03:05:25,101 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-28 03:05:25,101 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-28 03:05:25,101 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-28 03:05:25,102 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-28 03:05:25,102 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-28 03:05:25,102 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-28 03:05:25,102 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-28 03:05:25,102 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-28 03:05:25,103 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-28 03:05:25,103 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-28 03:05:25,103 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud-vcloud-master/worker/run_dir_9e8d23e1-c20e-44c6-8fc2-3dd2dd4e6337/bin/uautomizer/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_9e8d23e1-c20e-44c6-8fc2-3dd2dd4e6337/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6325feb12f40756470caf3b12878fd0ec9ad6f61 [2020-11-28 03:05:25,394 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-28 03:05:25,417 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-28 03:05:25,419 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-28 03:05:25,421 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-28 03:05:25,427 INFO L275 PluginConnector]: CDTParser initialized [2020-11-28 03:05:25,428 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_9e8d23e1-c20e-44c6-8fc2-3dd2dd4e6337/bin/uautomizer/../../sv-benchmarks/c/systemc/token_ring.01.cil-1.c [2020-11-28 03:05:25,501 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_9e8d23e1-c20e-44c6-8fc2-3dd2dd4e6337/bin/uautomizer/data/c3154ed6a/070926eaf7644c14a54d0156ced4133a/FLAG8cb850554 [2020-11-28 03:05:26,074 INFO L306 CDTParser]: Found 1 translation units. [2020-11-28 03:05:26,080 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_9e8d23e1-c20e-44c6-8fc2-3dd2dd4e6337/sv-benchmarks/c/systemc/token_ring.01.cil-1.c [2020-11-28 03:05:26,094 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_9e8d23e1-c20e-44c6-8fc2-3dd2dd4e6337/bin/uautomizer/data/c3154ed6a/070926eaf7644c14a54d0156ced4133a/FLAG8cb850554 [2020-11-28 03:05:26,402 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_9e8d23e1-c20e-44c6-8fc2-3dd2dd4e6337/bin/uautomizer/data/c3154ed6a/070926eaf7644c14a54d0156ced4133a [2020-11-28 03:05:26,404 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-28 03:05:26,406 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-28 03:05:26,416 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-28 03:05:26,417 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-28 03:05:26,422 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-28 03:05:26,423 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:05:26" (1/1) ... [2020-11-28 03:05:26,425 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17b91ec5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:05:26, skipping insertion in model container [2020-11-28 03:05:26,425 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:05:26" (1/1) ... [2020-11-28 03:05:26,433 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-28 03:05:26,485 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-28 03:05:26,714 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-28 03:05:26,727 INFO L203 MainTranslator]: Completed pre-run [2020-11-28 03:05:26,802 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-28 03:05:26,831 INFO L208 MainTranslator]: Completed translation [2020-11-28 03:05:26,832 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:05:26 WrapperNode [2020-11-28 03:05:26,832 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-28 03:05:26,833 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-28 03:05:26,834 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-28 03:05:26,834 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-28 03:05:26,847 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:05:26" (1/1) ... [2020-11-28 03:05:26,855 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:05:26" (1/1) ... [2020-11-28 03:05:26,889 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-28 03:05:26,890 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-28 03:05:26,891 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-28 03:05:26,891 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-28 03:05:26,900 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:05:26" (1/1) ... [2020-11-28 03:05:26,900 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:05:26" (1/1) ... [2020-11-28 03:05:26,904 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:05:26" (1/1) ... [2020-11-28 03:05:26,904 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:05:26" (1/1) ... [2020-11-28 03:05:26,912 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:05:26" (1/1) ... [2020-11-28 03:05:26,920 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:05:26" (1/1) ... [2020-11-28 03:05:26,924 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:05:26" (1/1) ... [2020-11-28 03:05:26,928 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-28 03:05:26,929 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-28 03:05:26,930 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-28 03:05:26,930 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-28 03:05:26,935 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:05:26" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9e8d23e1-c20e-44c6-8fc2-3dd2dd4e6337/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-28 03:05:27,016 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-28 03:05:27,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-28 03:05:27,017 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-28 03:05:27,017 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-28 03:05:27,851 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-28 03:05:27,851 INFO L298 CfgBuilder]: Removed 82 assume(true) statements. [2020-11-28 03:05:27,853 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:05:27 BoogieIcfgContainer [2020-11-28 03:05:27,854 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-28 03:05:27,861 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-28 03:05:27,863 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-28 03:05:27,868 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-28 03:05:27,868 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 03:05:26" (1/3) ... [2020-11-28 03:05:27,869 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58da9928 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:05:27, skipping insertion in model container [2020-11-28 03:05:27,869 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:05:26" (2/3) ... [2020-11-28 03:05:27,870 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58da9928 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:05:27, skipping insertion in model container [2020-11-28 03:05:27,870 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:05:27" (3/3) ... [2020-11-28 03:05:27,871 INFO L111 eAbstractionObserver]: Analyzing ICFG token_ring.01.cil-1.c [2020-11-28 03:05:27,884 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-28 03:05:27,889 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-28 03:05:27,905 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-11-28 03:05:27,957 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-28 03:05:27,959 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-28 03:05:27,959 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-28 03:05:27,964 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-28 03:05:27,964 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-28 03:05:27,965 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-28 03:05:27,965 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-28 03:05:27,965 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-28 03:05:27,990 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states. [2020-11-28 03:05:27,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-11-28 03:05:27,999 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:05:28,000 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:05:28,000 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:05:28,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:05:28,007 INFO L82 PathProgramCache]: Analyzing trace with hash 754195226, now seen corresponding path program 1 times [2020-11-28 03:05:28,019 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:05:28,019 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279107273] [2020-11-28 03:05:28,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:05:28,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:05:28,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:05:28,197 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279107273] [2020-11-28 03:05:28,198 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:05:28,199 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 03:05:28,200 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543985640] [2020-11-28 03:05:28,204 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-28 03:05:28,205 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:05:28,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 03:05:28,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:05:28,221 INFO L87 Difference]: Start difference. First operand 142 states. Second operand 3 states. [2020-11-28 03:05:28,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:05:28,272 INFO L93 Difference]: Finished difference Result 278 states and 432 transitions. [2020-11-28 03:05:28,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 03:05:28,274 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2020-11-28 03:05:28,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:05:28,285 INFO L225 Difference]: With dead ends: 278 [2020-11-28 03:05:28,286 INFO L226 Difference]: Without dead ends: 137 [2020-11-28 03:05:28,289 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:05:28,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2020-11-28 03:05:28,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2020-11-28 03:05:28,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2020-11-28 03:05:28,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 205 transitions. [2020-11-28 03:05:28,341 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 205 transitions. Word has length 39 [2020-11-28 03:05:28,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:05:28,342 INFO L481 AbstractCegarLoop]: Abstraction has 137 states and 205 transitions. [2020-11-28 03:05:28,342 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-28 03:05:28,342 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 205 transitions. [2020-11-28 03:05:28,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-11-28 03:05:28,344 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:05:28,344 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:05:28,345 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-28 03:05:28,345 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:05:28,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:05:28,346 INFO L82 PathProgramCache]: Analyzing trace with hash 1598200728, now seen corresponding path program 1 times [2020-11-28 03:05:28,346 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:05:28,346 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978741111] [2020-11-28 03:05:28,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:05:28,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:05:28,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:05:28,412 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978741111] [2020-11-28 03:05:28,412 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:05:28,412 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-28 03:05:28,412 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911908612] [2020-11-28 03:05:28,413 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-28 03:05:28,414 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:05:28,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 03:05:28,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:05:28,415 INFO L87 Difference]: Start difference. First operand 137 states and 205 transitions. Second operand 3 states. [2020-11-28 03:05:28,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:05:28,507 INFO L93 Difference]: Finished difference Result 363 states and 543 transitions. [2020-11-28 03:05:28,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 03:05:28,512 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2020-11-28 03:05:28,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:05:28,515 INFO L225 Difference]: With dead ends: 363 [2020-11-28 03:05:28,515 INFO L226 Difference]: Without dead ends: 232 [2020-11-28 03:05:28,516 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:05:28,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2020-11-28 03:05:28,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 230. [2020-11-28 03:05:28,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2020-11-28 03:05:28,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 341 transitions. [2020-11-28 03:05:28,585 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 341 transitions. Word has length 39 [2020-11-28 03:05:28,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:05:28,585 INFO L481 AbstractCegarLoop]: Abstraction has 230 states and 341 transitions. [2020-11-28 03:05:28,585 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-28 03:05:28,585 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 341 transitions. [2020-11-28 03:05:28,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-11-28 03:05:28,587 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:05:28,587 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:05:28,587 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-28 03:05:28,587 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:05:28,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:05:28,588 INFO L82 PathProgramCache]: Analyzing trace with hash 1655040020, now seen corresponding path program 1 times [2020-11-28 03:05:28,588 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:05:28,589 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945418197] [2020-11-28 03:05:28,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:05:28,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:05:28,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:05:28,715 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945418197] [2020-11-28 03:05:28,715 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:05:28,715 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 03:05:28,716 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174855254] [2020-11-28 03:05:28,716 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-28 03:05:28,716 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:05:28,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-28 03:05:28,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-28 03:05:28,718 INFO L87 Difference]: Start difference. First operand 230 states and 341 transitions. Second operand 4 states. [2020-11-28 03:05:28,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:05:28,825 INFO L93 Difference]: Finished difference Result 547 states and 810 transitions. [2020-11-28 03:05:28,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-28 03:05:28,826 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2020-11-28 03:05:28,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:05:28,829 INFO L225 Difference]: With dead ends: 547 [2020-11-28 03:05:28,829 INFO L226 Difference]: Without dead ends: 324 [2020-11-28 03:05:28,831 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-28 03:05:28,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2020-11-28 03:05:28,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 230. [2020-11-28 03:05:28,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2020-11-28 03:05:28,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 338 transitions. [2020-11-28 03:05:28,858 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 338 transitions. Word has length 39 [2020-11-28 03:05:28,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:05:28,859 INFO L481 AbstractCegarLoop]: Abstraction has 230 states and 338 transitions. [2020-11-28 03:05:28,859 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-28 03:05:28,859 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 338 transitions. [2020-11-28 03:05:28,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-11-28 03:05:28,861 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:05:28,861 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:05:28,861 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-28 03:05:28,861 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:05:28,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:05:28,862 INFO L82 PathProgramCache]: Analyzing trace with hash 1582653462, now seen corresponding path program 1 times [2020-11-28 03:05:28,863 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:05:28,863 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676022780] [2020-11-28 03:05:28,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:05:28,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:05:28,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:05:28,919 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676022780] [2020-11-28 03:05:28,919 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:05:28,919 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-28 03:05:28,919 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512914079] [2020-11-28 03:05:28,920 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-28 03:05:28,920 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:05:28,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 03:05:28,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:05:28,921 INFO L87 Difference]: Start difference. First operand 230 states and 338 transitions. Second operand 3 states. [2020-11-28 03:05:28,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:05:28,986 INFO L93 Difference]: Finished difference Result 452 states and 666 transitions. [2020-11-28 03:05:28,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 03:05:28,987 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2020-11-28 03:05:28,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:05:28,988 INFO L225 Difference]: With dead ends: 452 [2020-11-28 03:05:28,989 INFO L226 Difference]: Without dead ends: 230 [2020-11-28 03:05:28,994 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:05:28,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2020-11-28 03:05:29,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 230. [2020-11-28 03:05:29,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2020-11-28 03:05:29,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 324 transitions. [2020-11-28 03:05:29,025 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 324 transitions. Word has length 39 [2020-11-28 03:05:29,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:05:29,026 INFO L481 AbstractCegarLoop]: Abstraction has 230 states and 324 transitions. [2020-11-28 03:05:29,026 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-28 03:05:29,026 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 324 transitions. [2020-11-28 03:05:29,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-11-28 03:05:29,028 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:05:29,028 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:05:29,028 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-28 03:05:29,028 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:05:29,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:05:29,029 INFO L82 PathProgramCache]: Analyzing trace with hash 836344722, now seen corresponding path program 1 times [2020-11-28 03:05:29,029 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:05:29,029 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911172378] [2020-11-28 03:05:29,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:05:29,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:05:29,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:05:29,109 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911172378] [2020-11-28 03:05:29,110 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:05:29,110 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 03:05:29,110 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35815871] [2020-11-28 03:05:29,111 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-28 03:05:29,111 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:05:29,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-28 03:05:29,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-28 03:05:29,112 INFO L87 Difference]: Start difference. First operand 230 states and 324 transitions. Second operand 4 states. [2020-11-28 03:05:29,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:05:29,237 INFO L93 Difference]: Finished difference Result 529 states and 746 transitions. [2020-11-28 03:05:29,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-28 03:05:29,238 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2020-11-28 03:05:29,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:05:29,241 INFO L225 Difference]: With dead ends: 529 [2020-11-28 03:05:29,241 INFO L226 Difference]: Without dead ends: 308 [2020-11-28 03:05:29,241 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-28 03:05:29,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2020-11-28 03:05:29,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 230. [2020-11-28 03:05:29,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2020-11-28 03:05:29,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 321 transitions. [2020-11-28 03:05:29,267 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 321 transitions. Word has length 39 [2020-11-28 03:05:29,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:05:29,268 INFO L481 AbstractCegarLoop]: Abstraction has 230 states and 321 transitions. [2020-11-28 03:05:29,268 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-28 03:05:29,268 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 321 transitions. [2020-11-28 03:05:29,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-11-28 03:05:29,273 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:05:29,273 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:05:29,273 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-28 03:05:29,273 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:05:29,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:05:29,274 INFO L82 PathProgramCache]: Analyzing trace with hash 1537944596, now seen corresponding path program 1 times [2020-11-28 03:05:29,274 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:05:29,274 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181779051] [2020-11-28 03:05:29,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:05:29,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:05:29,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:05:29,344 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181779051] [2020-11-28 03:05:29,344 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:05:29,344 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 03:05:29,344 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590872462] [2020-11-28 03:05:29,345 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-28 03:05:29,345 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:05:29,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-28 03:05:29,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-28 03:05:29,346 INFO L87 Difference]: Start difference. First operand 230 states and 321 transitions. Second operand 4 states. [2020-11-28 03:05:29,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:05:29,529 INFO L93 Difference]: Finished difference Result 784 states and 1096 transitions. [2020-11-28 03:05:29,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-28 03:05:29,530 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2020-11-28 03:05:29,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:05:29,534 INFO L225 Difference]: With dead ends: 784 [2020-11-28 03:05:29,535 INFO L226 Difference]: Without dead ends: 565 [2020-11-28 03:05:29,536 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-28 03:05:29,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2020-11-28 03:05:29,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 519. [2020-11-28 03:05:29,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 519 states. [2020-11-28 03:05:29,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 712 transitions. [2020-11-28 03:05:29,580 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 712 transitions. Word has length 39 [2020-11-28 03:05:29,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:05:29,586 INFO L481 AbstractCegarLoop]: Abstraction has 519 states and 712 transitions. [2020-11-28 03:05:29,586 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-28 03:05:29,586 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 712 transitions. [2020-11-28 03:05:29,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-11-28 03:05:29,592 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:05:29,592 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:05:29,592 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-28 03:05:29,593 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:05:29,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:05:29,594 INFO L82 PathProgramCache]: Analyzing trace with hash -254561332, now seen corresponding path program 1 times [2020-11-28 03:05:29,594 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:05:29,595 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558882300] [2020-11-28 03:05:29,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:05:29,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:05:29,684 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-11-28 03:05:29,684 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558882300] [2020-11-28 03:05:29,685 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:05:29,685 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-28 03:05:29,685 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019725247] [2020-11-28 03:05:29,685 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-28 03:05:29,685 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:05:29,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-28 03:05:29,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-28 03:05:29,686 INFO L87 Difference]: Start difference. First operand 519 states and 712 transitions. Second operand 5 states. [2020-11-28 03:05:29,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:05:29,882 INFO L93 Difference]: Finished difference Result 1311 states and 1809 transitions. [2020-11-28 03:05:29,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-28 03:05:29,883 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2020-11-28 03:05:29,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:05:29,888 INFO L225 Difference]: With dead ends: 1311 [2020-11-28 03:05:29,889 INFO L226 Difference]: Without dead ends: 813 [2020-11-28 03:05:29,890 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-11-28 03:05:29,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 813 states. [2020-11-28 03:05:29,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 813 to 540. [2020-11-28 03:05:29,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 540 states. [2020-11-28 03:05:29,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 724 transitions. [2020-11-28 03:05:29,931 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 724 transitions. Word has length 51 [2020-11-28 03:05:29,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:05:29,932 INFO L481 AbstractCegarLoop]: Abstraction has 540 states and 724 transitions. [2020-11-28 03:05:29,932 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-28 03:05:29,932 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 724 transitions. [2020-11-28 03:05:29,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-11-28 03:05:29,933 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:05:29,933 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:05:29,934 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-28 03:05:29,934 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:05:29,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:05:29,934 INFO L82 PathProgramCache]: Analyzing trace with hash 447038542, now seen corresponding path program 1 times [2020-11-28 03:05:29,935 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:05:29,935 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234855106] [2020-11-28 03:05:29,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:05:29,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:05:29,990 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-11-28 03:05:29,990 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234855106] [2020-11-28 03:05:29,990 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:05:29,990 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 03:05:29,991 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932561967] [2020-11-28 03:05:29,991 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-28 03:05:29,991 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:05:29,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-28 03:05:29,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-28 03:05:29,992 INFO L87 Difference]: Start difference. First operand 540 states and 724 transitions. Second operand 4 states. [2020-11-28 03:05:30,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:05:30,115 INFO L93 Difference]: Finished difference Result 1284 states and 1724 transitions. [2020-11-28 03:05:30,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-28 03:05:30,116 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2020-11-28 03:05:30,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:05:30,121 INFO L225 Difference]: With dead ends: 1284 [2020-11-28 03:05:30,121 INFO L226 Difference]: Without dead ends: 767 [2020-11-28 03:05:30,123 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-28 03:05:30,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 767 states. [2020-11-28 03:05:30,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 767 to 540. [2020-11-28 03:05:30,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 540 states. [2020-11-28 03:05:30,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 711 transitions. [2020-11-28 03:05:30,175 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 711 transitions. Word has length 51 [2020-11-28 03:05:30,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:05:30,176 INFO L481 AbstractCegarLoop]: Abstraction has 540 states and 711 transitions. [2020-11-28 03:05:30,176 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-28 03:05:30,176 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 711 transitions. [2020-11-28 03:05:30,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-11-28 03:05:30,177 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:05:30,178 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:05:30,178 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-28 03:05:30,178 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:05:30,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:05:30,179 INFO L82 PathProgramCache]: Analyzing trace with hash 1833241936, now seen corresponding path program 1 times [2020-11-28 03:05:30,179 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:05:30,179 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015638293] [2020-11-28 03:05:30,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:05:30,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:05:30,282 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:05:30,282 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015638293] [2020-11-28 03:05:30,282 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:05:30,282 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 03:05:30,283 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120025069] [2020-11-28 03:05:30,283 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-28 03:05:30,283 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:05:30,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 03:05:30,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:05:30,284 INFO L87 Difference]: Start difference. First operand 540 states and 711 transitions. Second operand 3 states. [2020-11-28 03:05:30,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:05:30,410 INFO L93 Difference]: Finished difference Result 1511 states and 1975 transitions. [2020-11-28 03:05:30,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 03:05:30,411 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2020-11-28 03:05:30,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:05:30,419 INFO L225 Difference]: With dead ends: 1511 [2020-11-28 03:05:30,419 INFO L226 Difference]: Without dead ends: 996 [2020-11-28 03:05:30,421 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:05:30,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 996 states. [2020-11-28 03:05:30,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 996 to 960. [2020-11-28 03:05:30,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 960 states. [2020-11-28 03:05:30,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 960 states to 960 states and 1226 transitions. [2020-11-28 03:05:30,510 INFO L78 Accepts]: Start accepts. Automaton has 960 states and 1226 transitions. Word has length 51 [2020-11-28 03:05:30,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:05:30,510 INFO L481 AbstractCegarLoop]: Abstraction has 960 states and 1226 transitions. [2020-11-28 03:05:30,511 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-28 03:05:30,511 INFO L276 IsEmpty]: Start isEmpty. Operand 960 states and 1226 transitions. [2020-11-28 03:05:30,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-11-28 03:05:30,512 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:05:30,512 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:05:30,512 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-28 03:05:30,512 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:05:30,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:05:30,513 INFO L82 PathProgramCache]: Analyzing trace with hash 1279747345, now seen corresponding path program 1 times [2020-11-28 03:05:30,513 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:05:30,514 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903197108] [2020-11-28 03:05:30,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:05:30,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:05:30,584 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-11-28 03:05:30,585 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903197108] [2020-11-28 03:05:30,585 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:05:30,586 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-28 03:05:30,586 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665655243] [2020-11-28 03:05:30,586 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-28 03:05:30,587 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:05:30,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 03:05:30,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:05:30,588 INFO L87 Difference]: Start difference. First operand 960 states and 1226 transitions. Second operand 3 states. [2020-11-28 03:05:30,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:05:30,731 INFO L93 Difference]: Finished difference Result 2284 states and 2945 transitions. [2020-11-28 03:05:30,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 03:05:30,734 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2020-11-28 03:05:30,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:05:30,744 INFO L225 Difference]: With dead ends: 2284 [2020-11-28 03:05:30,744 INFO L226 Difference]: Without dead ends: 1602 [2020-11-28 03:05:30,746 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:05:30,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1602 states. [2020-11-28 03:05:30,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1602 to 1312. [2020-11-28 03:05:30,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1312 states. [2020-11-28 03:05:30,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1312 states to 1312 states and 1678 transitions. [2020-11-28 03:05:30,867 INFO L78 Accepts]: Start accepts. Automaton has 1312 states and 1678 transitions. Word has length 52 [2020-11-28 03:05:30,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:05:30,867 INFO L481 AbstractCegarLoop]: Abstraction has 1312 states and 1678 transitions. [2020-11-28 03:05:30,867 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-28 03:05:30,868 INFO L276 IsEmpty]: Start isEmpty. Operand 1312 states and 1678 transitions. [2020-11-28 03:05:30,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-11-28 03:05:30,869 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:05:30,869 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:05:30,869 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-28 03:05:30,869 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:05:30,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:05:30,870 INFO L82 PathProgramCache]: Analyzing trace with hash -272953241, now seen corresponding path program 1 times [2020-11-28 03:05:30,870 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:05:30,870 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455901388] [2020-11-28 03:05:30,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:05:30,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:05:30,939 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:05:30,940 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455901388] [2020-11-28 03:05:30,940 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:05:30,940 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-28 03:05:30,940 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481885675] [2020-11-28 03:05:30,941 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-28 03:05:30,941 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:05:30,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-28 03:05:30,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-28 03:05:30,942 INFO L87 Difference]: Start difference. First operand 1312 states and 1678 transitions. Second operand 5 states. [2020-11-28 03:05:31,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:05:31,169 INFO L93 Difference]: Finished difference Result 2538 states and 3250 transitions. [2020-11-28 03:05:31,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-28 03:05:31,169 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 63 [2020-11-28 03:05:31,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:05:31,178 INFO L225 Difference]: With dead ends: 2538 [2020-11-28 03:05:31,178 INFO L226 Difference]: Without dead ends: 1554 [2020-11-28 03:05:31,180 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-11-28 03:05:31,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1554 states. [2020-11-28 03:05:31,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1554 to 1324. [2020-11-28 03:05:31,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1324 states. [2020-11-28 03:05:31,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1324 states to 1324 states and 1656 transitions. [2020-11-28 03:05:31,287 INFO L78 Accepts]: Start accepts. Automaton has 1324 states and 1656 transitions. Word has length 63 [2020-11-28 03:05:31,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:05:31,288 INFO L481 AbstractCegarLoop]: Abstraction has 1324 states and 1656 transitions. [2020-11-28 03:05:31,288 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-28 03:05:31,288 INFO L276 IsEmpty]: Start isEmpty. Operand 1324 states and 1656 transitions. [2020-11-28 03:05:31,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-11-28 03:05:31,289 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:05:31,289 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:05:31,289 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-28 03:05:31,289 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:05:31,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:05:31,290 INFO L82 PathProgramCache]: Analyzing trace with hash 149748585, now seen corresponding path program 1 times [2020-11-28 03:05:31,290 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:05:31,291 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145133366] [2020-11-28 03:05:31,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:05:31,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:05:31,325 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:05:31,325 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145133366] [2020-11-28 03:05:31,325 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:05:31,326 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 03:05:31,326 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210419736] [2020-11-28 03:05:31,326 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-28 03:05:31,326 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:05:31,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 03:05:31,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:05:31,327 INFO L87 Difference]: Start difference. First operand 1324 states and 1656 transitions. Second operand 3 states. [2020-11-28 03:05:31,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:05:31,559 INFO L93 Difference]: Finished difference Result 3688 states and 4602 transitions. [2020-11-28 03:05:31,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 03:05:31,560 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2020-11-28 03:05:31,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:05:31,574 INFO L225 Difference]: With dead ends: 3688 [2020-11-28 03:05:31,574 INFO L226 Difference]: Without dead ends: 2410 [2020-11-28 03:05:31,579 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:05:31,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2410 states. [2020-11-28 03:05:31,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2410 to 2384. [2020-11-28 03:05:31,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2384 states. [2020-11-28 03:05:31,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2384 states to 2384 states and 2930 transitions. [2020-11-28 03:05:31,795 INFO L78 Accepts]: Start accepts. Automaton has 2384 states and 2930 transitions. Word has length 63 [2020-11-28 03:05:31,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:05:31,797 INFO L481 AbstractCegarLoop]: Abstraction has 2384 states and 2930 transitions. [2020-11-28 03:05:31,797 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-28 03:05:31,797 INFO L276 IsEmpty]: Start isEmpty. Operand 2384 states and 2930 transitions. [2020-11-28 03:05:31,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2020-11-28 03:05:31,798 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:05:31,799 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:05:31,799 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-28 03:05:31,799 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:05:31,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:05:31,800 INFO L82 PathProgramCache]: Analyzing trace with hash -200227224, now seen corresponding path program 1 times [2020-11-28 03:05:31,800 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:05:31,800 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041026178] [2020-11-28 03:05:31,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:05:31,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:05:31,851 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:05:31,852 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041026178] [2020-11-28 03:05:31,852 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:05:31,852 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-28 03:05:31,852 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336017936] [2020-11-28 03:05:31,852 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-28 03:05:31,853 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:05:31,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-28 03:05:31,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-28 03:05:31,854 INFO L87 Difference]: Start difference. First operand 2384 states and 2930 transitions. Second operand 4 states. [2020-11-28 03:05:32,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:05:32,119 INFO L93 Difference]: Finished difference Result 4190 states and 5144 transitions. [2020-11-28 03:05:32,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-28 03:05:32,120 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2020-11-28 03:05:32,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:05:32,130 INFO L225 Difference]: With dead ends: 4190 [2020-11-28 03:05:32,130 INFO L226 Difference]: Without dead ends: 1831 [2020-11-28 03:05:32,134 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-28 03:05:32,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1831 states. [2020-11-28 03:05:32,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1831 to 1829. [2020-11-28 03:05:32,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1829 states. [2020-11-28 03:05:32,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1829 states to 1829 states and 2207 transitions. [2020-11-28 03:05:32,297 INFO L78 Accepts]: Start accepts. Automaton has 1829 states and 2207 transitions. Word has length 64 [2020-11-28 03:05:32,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:05:32,297 INFO L481 AbstractCegarLoop]: Abstraction has 1829 states and 2207 transitions. [2020-11-28 03:05:32,298 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-28 03:05:32,298 INFO L276 IsEmpty]: Start isEmpty. Operand 1829 states and 2207 transitions. [2020-11-28 03:05:32,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2020-11-28 03:05:32,300 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:05:32,300 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:05:32,300 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-11-28 03:05:32,300 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:05:32,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:05:32,301 INFO L82 PathProgramCache]: Analyzing trace with hash 220559698, now seen corresponding path program 1 times [2020-11-28 03:05:32,301 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:05:32,301 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801025151] [2020-11-28 03:05:32,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:05:32,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:05:32,345 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-11-28 03:05:32,345 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801025151] [2020-11-28 03:05:32,345 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:05:32,345 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-28 03:05:32,346 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731690506] [2020-11-28 03:05:32,346 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-28 03:05:32,346 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:05:32,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-28 03:05:32,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-28 03:05:32,347 INFO L87 Difference]: Start difference. First operand 1829 states and 2207 transitions. Second operand 4 states. [2020-11-28 03:05:32,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:05:32,590 INFO L93 Difference]: Finished difference Result 3657 states and 4409 transitions. [2020-11-28 03:05:32,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-28 03:05:32,591 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2020-11-28 03:05:32,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:05:32,599 INFO L225 Difference]: With dead ends: 3657 [2020-11-28 03:05:32,600 INFO L226 Difference]: Without dead ends: 1586 [2020-11-28 03:05:32,604 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-28 03:05:32,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1586 states. [2020-11-28 03:05:32,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1586 to 1559. [2020-11-28 03:05:32,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1559 states. [2020-11-28 03:05:32,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1559 states to 1559 states and 1866 transitions. [2020-11-28 03:05:32,727 INFO L78 Accepts]: Start accepts. Automaton has 1559 states and 1866 transitions. Word has length 94 [2020-11-28 03:05:32,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:05:32,728 INFO L481 AbstractCegarLoop]: Abstraction has 1559 states and 1866 transitions. [2020-11-28 03:05:32,728 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-28 03:05:32,728 INFO L276 IsEmpty]: Start isEmpty. Operand 1559 states and 1866 transitions. [2020-11-28 03:05:32,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2020-11-28 03:05:32,730 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:05:32,730 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:05:32,730 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-11-28 03:05:32,730 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:05:32,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:05:32,731 INFO L82 PathProgramCache]: Analyzing trace with hash 579367125, now seen corresponding path program 1 times [2020-11-28 03:05:32,731 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:05:32,732 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128395929] [2020-11-28 03:05:32,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:05:32,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:05:32,792 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-11-28 03:05:32,793 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128395929] [2020-11-28 03:05:32,793 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:05:32,793 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-28 03:05:32,794 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2754270] [2020-11-28 03:05:32,794 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-28 03:05:32,794 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:05:32,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-28 03:05:32,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-28 03:05:32,795 INFO L87 Difference]: Start difference. First operand 1559 states and 1866 transitions. Second operand 4 states. [2020-11-28 03:05:32,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:05:32,978 INFO L93 Difference]: Finished difference Result 2553 states and 3030 transitions. [2020-11-28 03:05:32,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-28 03:05:32,978 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2020-11-28 03:05:32,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:05:32,983 INFO L225 Difference]: With dead ends: 2553 [2020-11-28 03:05:32,983 INFO L226 Difference]: Without dead ends: 704 [2020-11-28 03:05:32,987 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-28 03:05:32,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704 states. [2020-11-28 03:05:33,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 704 to 699. [2020-11-28 03:05:33,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 699 states. [2020-11-28 03:05:33,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 777 transitions. [2020-11-28 03:05:33,055 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 777 transitions. Word has length 94 [2020-11-28 03:05:33,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:05:33,055 INFO L481 AbstractCegarLoop]: Abstraction has 699 states and 777 transitions. [2020-11-28 03:05:33,055 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-28 03:05:33,055 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 777 transitions. [2020-11-28 03:05:33,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2020-11-28 03:05:33,057 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:05:33,057 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:05:33,057 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-11-28 03:05:33,057 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:05:33,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:05:33,058 INFO L82 PathProgramCache]: Analyzing trace with hash 219632562, now seen corresponding path program 1 times [2020-11-28 03:05:33,058 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:05:33,058 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303151770] [2020-11-28 03:05:33,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:05:33,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:05:33,104 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:05:33,104 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303151770] [2020-11-28 03:05:33,106 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:05:33,107 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 03:05:33,107 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218411450] [2020-11-28 03:05:33,107 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-28 03:05:33,107 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:05:33,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 03:05:33,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:05:33,108 INFO L87 Difference]: Start difference. First operand 699 states and 777 transitions. Second operand 3 states. [2020-11-28 03:05:33,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:05:33,171 INFO L93 Difference]: Finished difference Result 1019 states and 1137 transitions. [2020-11-28 03:05:33,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 03:05:33,171 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2020-11-28 03:05:33,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:05:33,175 INFO L225 Difference]: With dead ends: 1019 [2020-11-28 03:05:33,175 INFO L226 Difference]: Without dead ends: 582 [2020-11-28 03:05:33,176 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:05:33,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2020-11-28 03:05:33,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 582. [2020-11-28 03:05:33,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 582 states. [2020-11-28 03:05:33,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 641 transitions. [2020-11-28 03:05:33,220 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 641 transitions. Word has length 94 [2020-11-28 03:05:33,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:05:33,220 INFO L481 AbstractCegarLoop]: Abstraction has 582 states and 641 transitions. [2020-11-28 03:05:33,220 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-28 03:05:33,220 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 641 transitions. [2020-11-28 03:05:33,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2020-11-28 03:05:33,221 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:05:33,222 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:05:33,222 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-11-28 03:05:33,222 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:05:33,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:05:33,222 INFO L82 PathProgramCache]: Analyzing trace with hash -880867770, now seen corresponding path program 1 times [2020-11-28 03:05:33,222 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:05:33,223 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623959549] [2020-11-28 03:05:33,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:05:33,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:05:33,330 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-11-28 03:05:33,330 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623959549] [2020-11-28 03:05:33,330 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:05:33,330 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-28 03:05:33,330 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561923041] [2020-11-28 03:05:33,331 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-28 03:05:33,331 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:05:33,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-28 03:05:33,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-28 03:05:33,332 INFO L87 Difference]: Start difference. First operand 582 states and 641 transitions. Second operand 4 states. [2020-11-28 03:05:33,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:05:33,408 INFO L93 Difference]: Finished difference Result 586 states and 645 transitions. [2020-11-28 03:05:33,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-28 03:05:33,408 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2020-11-28 03:05:33,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:05:33,409 INFO L225 Difference]: With dead ends: 586 [2020-11-28 03:05:33,409 INFO L226 Difference]: Without dead ends: 0 [2020-11-28 03:05:33,410 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-28 03:05:33,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-11-28 03:05:33,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-11-28 03:05:33,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-11-28 03:05:33,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-11-28 03:05:33,411 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 95 [2020-11-28 03:05:33,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:05:33,411 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-28 03:05:33,411 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-28 03:05:33,411 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-11-28 03:05:33,411 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-11-28 03:05:33,411 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-11-28 03:05:33,413 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-11-28 03:05:33,524 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 55 [2020-11-28 03:05:33,649 WARN L193 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 118 [2020-11-28 03:05:36,380 WARN L193 SmtUtils]: Spent 655.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 54 [2020-11-28 03:05:36,745 WARN L193 SmtUtils]: Spent 362.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 48 [2020-11-28 03:05:37,442 WARN L193 SmtUtils]: Spent 695.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 58 [2020-11-28 03:05:37,658 WARN L193 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 44 [2020-11-28 03:05:38,152 WARN L193 SmtUtils]: Spent 492.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 60 [2020-11-28 03:05:38,351 WARN L193 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 42 [2020-11-28 03:05:38,760 WARN L193 SmtUtils]: Spent 408.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2020-11-28 03:05:38,910 WARN L193 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 37 [2020-11-28 03:05:39,422 WARN L193 SmtUtils]: Spent 511.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 54 [2020-11-28 03:05:39,647 WARN L193 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 39 [2020-11-28 03:05:40,151 WARN L193 SmtUtils]: Spent 502.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 60 [2020-11-28 03:05:40,270 WARN L193 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 41 [2020-11-28 03:05:40,425 WARN L193 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 31 [2020-11-28 03:05:40,922 WARN L193 SmtUtils]: Spent 496.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 58 [2020-11-28 03:05:41,524 WARN L193 SmtUtils]: Spent 600.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 58 [2020-11-28 03:05:42,021 WARN L193 SmtUtils]: Spent 495.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 58 [2020-11-28 03:05:42,616 WARN L193 SmtUtils]: Spent 594.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 60 [2020-11-28 03:05:43,100 WARN L193 SmtUtils]: Spent 482.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 58 [2020-11-28 03:05:43,603 WARN L193 SmtUtils]: Spent 501.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 60 [2020-11-28 03:05:44,047 WARN L193 SmtUtils]: Spent 439.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 58 [2020-11-28 03:05:44,447 WARN L193 SmtUtils]: Spent 399.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 54 [2020-11-28 03:05:44,893 WARN L193 SmtUtils]: Spent 444.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2020-11-28 03:05:45,377 WARN L193 SmtUtils]: Spent 482.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 56 [2020-11-28 03:05:45,549 WARN L193 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 46 [2020-11-28 03:05:45,786 WARN L193 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 40 [2020-11-28 03:05:46,001 WARN L193 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 45 [2020-11-28 03:05:46,482 WARN L193 SmtUtils]: Spent 480.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 58 [2020-11-28 03:05:46,643 WARN L193 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 39 [2020-11-28 03:05:46,763 WARN L193 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 39 [2020-11-28 03:05:46,880 WARN L193 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 33 [2020-11-28 03:05:47,049 WARN L193 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 41 [2020-11-28 03:05:47,264 WARN L193 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 44 [2020-11-28 03:05:47,823 WARN L193 SmtUtils]: Spent 557.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 60 [2020-11-28 03:05:48,258 WARN L193 SmtUtils]: Spent 434.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 58 [2020-11-28 03:05:48,804 WARN L193 SmtUtils]: Spent 504.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 58 [2020-11-28 03:05:49,284 WARN L193 SmtUtils]: Spent 477.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 58 [2020-11-28 03:05:49,655 WARN L193 SmtUtils]: Spent 370.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2020-11-28 03:05:50,168 WARN L193 SmtUtils]: Spent 414.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 52 [2020-11-28 03:05:50,626 WARN L193 SmtUtils]: Spent 456.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 60 [2020-11-28 03:05:50,886 WARN L193 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 54 [2020-11-28 03:05:51,015 WARN L193 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 37 [2020-11-28 03:05:51,125 WARN L193 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 37 [2020-11-28 03:05:51,700 WARN L193 SmtUtils]: Spent 478.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 58 [2020-11-28 03:05:52,157 WARN L193 SmtUtils]: Spent 456.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 60 [2020-11-28 03:05:52,750 WARN L193 SmtUtils]: Spent 591.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 58 [2020-11-28 03:05:52,760 INFO L274 CegarLoopResult]: For program point L135(lines 135 144) no Hoare annotation was computed. [2020-11-28 03:05:52,760 INFO L274 CegarLoopResult]: For program point L135-2(lines 135 144) no Hoare annotation was computed. [2020-11-28 03:05:52,760 INFO L274 CegarLoopResult]: For program point L36(lines 36 44) no Hoare annotation was computed. [2020-11-28 03:05:52,760 INFO L274 CegarLoopResult]: For program point L135-3(lines 135 144) no Hoare annotation was computed. [2020-11-28 03:05:52,760 INFO L274 CegarLoopResult]: For program point L3(line 3) no Hoare annotation was computed. [2020-11-28 03:05:52,760 INFO L274 CegarLoopResult]: For program point L135-5(lines 135 144) no Hoare annotation was computed. [2020-11-28 03:05:52,760 INFO L274 CegarLoopResult]: For program point L135-6(lines 135 144) no Hoare annotation was computed. [2020-11-28 03:05:52,760 INFO L274 CegarLoopResult]: For program point L135-8(lines 135 144) no Hoare annotation was computed. [2020-11-28 03:05:52,760 INFO L274 CegarLoopResult]: For program point L135-9(lines 135 144) no Hoare annotation was computed. [2020-11-28 03:05:52,761 INFO L274 CegarLoopResult]: For program point L135-11(lines 135 144) no Hoare annotation was computed. [2020-11-28 03:05:52,761 INFO L274 CegarLoopResult]: For program point L135-12(lines 135 144) no Hoare annotation was computed. [2020-11-28 03:05:52,761 INFO L274 CegarLoopResult]: For program point L135-14(lines 135 144) no Hoare annotation was computed. [2020-11-28 03:05:52,761 INFO L274 CegarLoopResult]: For program point L136(lines 136 141) no Hoare annotation was computed. [2020-11-28 03:05:52,761 INFO L274 CegarLoopResult]: For program point L136-1(lines 136 141) no Hoare annotation was computed. [2020-11-28 03:05:52,761 INFO L274 CegarLoopResult]: For program point L136-2(lines 136 141) no Hoare annotation was computed. [2020-11-28 03:05:52,761 INFO L274 CegarLoopResult]: For program point L136-3(lines 136 141) no Hoare annotation was computed. [2020-11-28 03:05:52,761 INFO L274 CegarLoopResult]: For program point L136-4(lines 136 141) no Hoare annotation was computed. [2020-11-28 03:05:52,762 INFO L270 CegarLoopResult]: At program point L401(lines 390 403) the Hoare annotation is: (let ((.cse17 (= ~t1_pc~0 1))) (let ((.cse3 (not (= ~t1_st~0 0))) (.cse16 (<= ~token~0 ~local~0)) (.cse18 (<= ~local~0 ~token~0)) (.cse0 (= |ULTIMATE.start_is_transmit1_triggered_#res| 0)) (.cse15 (not (= ~E_1~0 1))) (.cse6 (not .cse17)) (.cse8 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse9 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse1 (not (= ~E_1~0 0))) (.cse7 (= |ULTIMATE.start_is_master_triggered_#res| 0)) (.cse2 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse10 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse11 (not (= ~T1_E~0 1))) (.cse12 (= ~t1_i~0 1)) (.cse4 (not (= ~T1_E~0 0))) (.cse13 (<= 2 ~E_M~0)) (.cse14 (not (= ~m_st~0 0))) (.cse5 (= ~m_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse14 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse1 .cse2 .cse15 .cse16 .cse3 .cse4 .cse5 .cse17 .cse7 .cse10 .cse11 .cse12 .cse18 .cse13) (and .cse1 .cse7 .cse2 .cse15 .cse10 .cse11 .cse12 .cse3 .cse4 .cse13 .cse14) (and .cse1 .cse2 .cse15 .cse3 .cse4 (<= (+ ~local~0 1) ~token~0) .cse17 .cse7 .cse10 .cse11 .cse12 (< ~token~0 (+ ~local~0 2)) .cse13) (and .cse0 .cse1 .cse2 .cse15 .cse16 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse18 .cse13) (and .cse1 .cse2 .cse15 .cse16 .cse4 .cse14 .cse17 .cse7 .cse10 .cse11 .cse12 .cse18 .cse13) (and .cse0 .cse1 .cse2 .cse15 .cse14 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse1 .cse7 .cse2 .cse10 .cse11 .cse12 .cse4 .cse13 .cse14 .cse5)))) [2020-11-28 03:05:52,762 INFO L274 CegarLoopResult]: For program point L203(line 203) no Hoare annotation was computed. [2020-11-28 03:05:52,763 INFO L270 CegarLoopResult]: At program point L402(lines 386 404) the Hoare annotation is: (let ((.cse17 (= ~t1_pc~0 1))) (let ((.cse3 (not (= ~t1_st~0 0))) (.cse16 (<= ~token~0 ~local~0)) (.cse18 (<= ~local~0 ~token~0)) (.cse0 (= |ULTIMATE.start_is_transmit1_triggered_#res| 0)) (.cse15 (not (= ~E_1~0 1))) (.cse6 (not .cse17)) (.cse8 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse9 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse1 (not (= ~E_1~0 0))) (.cse7 (= |ULTIMATE.start_is_master_triggered_#res| 0)) (.cse2 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse10 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse11 (not (= ~T1_E~0 1))) (.cse12 (= ~t1_i~0 1)) (.cse4 (not (= ~T1_E~0 0))) (.cse13 (<= 2 ~E_M~0)) (.cse14 (not (= ~m_st~0 0))) (.cse5 (= ~m_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse14 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse1 .cse2 .cse15 .cse16 .cse3 .cse4 .cse5 .cse17 .cse7 .cse10 .cse11 .cse12 .cse18 .cse13) (and .cse1 .cse7 .cse2 .cse15 .cse10 .cse11 .cse12 .cse3 .cse4 .cse13 .cse14) (and .cse1 .cse2 .cse15 .cse3 .cse4 (<= (+ ~local~0 1) ~token~0) .cse17 .cse7 .cse10 .cse11 .cse12 (< ~token~0 (+ ~local~0 2)) .cse13) (and .cse0 .cse1 .cse2 .cse15 .cse16 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse18 .cse13) (and .cse1 .cse2 .cse15 .cse16 .cse4 .cse14 .cse17 .cse7 .cse10 .cse11 .cse12 .cse18 .cse13) (and .cse0 .cse1 .cse2 .cse15 .cse14 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse1 .cse7 .cse2 .cse10 .cse11 .cse12 .cse4 .cse13 .cse14 .cse5)))) [2020-11-28 03:05:52,763 INFO L274 CegarLoopResult]: For program point L39(lines 39 43) no Hoare annotation was computed. [2020-11-28 03:05:52,764 INFO L270 CegarLoopResult]: At program point L40(lines 35 74) the Hoare annotation is: (and (<= (+ ~local~0 1) ~token~0) (not (= ~E_1~0 0)) (= ~t1_pc~0 1) (not (= ~E_1~0 1)) (not (= ~T1_E~0 1)) (= ~t1_i~0 1) (< ~token~0 (+ ~local~0 2)) (not (= ~t1_st~0 0)) (not (= ~T1_E~0 0)) (<= 2 ~E_M~0) (not (= ~m_st~0 0))) [2020-11-28 03:05:52,764 INFO L274 CegarLoopResult]: For program point L207(lines 207 211) no Hoare annotation was computed. [2020-11-28 03:05:52,764 INFO L274 CegarLoopResult]: For program point L207-1(lines 202 240) no Hoare annotation was computed. [2020-11-28 03:05:52,764 INFO L274 CegarLoopResult]: For program point L439(lines 439 448) no Hoare annotation was computed. [2020-11-28 03:05:52,764 INFO L270 CegarLoopResult]: At program point L439-1(lines 439 448) the Hoare annotation is: (let ((.cse17 (= ~t1_pc~0 1))) (let ((.cse3 (not (= ~t1_st~0 0))) (.cse16 (<= ~token~0 ~local~0)) (.cse18 (<= ~local~0 ~token~0)) (.cse0 (= |ULTIMATE.start_is_transmit1_triggered_#res| 0)) (.cse15 (not (= ~E_1~0 1))) (.cse6 (not .cse17)) (.cse8 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse9 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse1 (not (= ~E_1~0 0))) (.cse7 (= |ULTIMATE.start_is_master_triggered_#res| 0)) (.cse2 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse10 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse11 (not (= ~T1_E~0 1))) (.cse12 (= ~t1_i~0 1)) (.cse4 (not (= ~T1_E~0 0))) (.cse13 (<= 2 ~E_M~0)) (.cse14 (not (= ~m_st~0 0))) (.cse5 (= ~m_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse14 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse1 .cse2 .cse15 .cse16 .cse3 .cse4 .cse5 .cse17 .cse7 .cse10 .cse11 .cse12 .cse18 .cse13) (and .cse1 .cse7 .cse2 .cse15 .cse10 .cse11 .cse12 .cse3 .cse4 .cse13 .cse14) (and .cse1 .cse2 .cse15 .cse3 .cse4 (<= (+ ~local~0 1) ~token~0) .cse17 .cse7 .cse10 .cse11 .cse12 (< ~token~0 (+ ~local~0 2)) .cse13) (and .cse0 .cse1 .cse2 .cse15 .cse16 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse18 .cse13) (and .cse1 .cse2 .cse15 .cse16 .cse4 .cse14 .cse17 .cse7 .cse10 .cse11 .cse12 .cse18 .cse13) (and .cse0 .cse1 .cse2 .cse15 .cse14 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse1 .cse7 .cse2 .cse10 .cse11 .cse12 .cse4 .cse13 .cse14 .cse5)))) [2020-11-28 03:05:52,765 INFO L270 CegarLoopResult]: At program point L241(lines 196 246) the Hoare annotation is: (let ((.cse19 (= ~m_st~0 0)) (.cse14 (= ~t1_pc~0 1))) (let ((.cse16 (<= ~token~0 ~local~0)) (.cse17 (<= ~local~0 ~token~0)) (.cse0 (= |ULTIMATE.start_is_transmit1_triggered_#res| 0)) (.cse6 (not .cse14)) (.cse8 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse9 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse7 (= |ULTIMATE.start_is_master_triggered_#res| 0)) (.cse10 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse5 (= ~m_pc~0 0)) (.cse1 (not (= ~E_1~0 0))) (.cse2 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse15 (not (= ~E_1~0 1))) (.cse11 (not (= ~T1_E~0 1))) (.cse12 (= ~t1_i~0 1)) (.cse3 (not (= ~t1_st~0 0))) (.cse4 (not (= ~T1_E~0 0))) (.cse13 (<= 2 ~E_M~0)) (.cse18 (not .cse19))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse1 .cse14 .cse2 .cse15 .cse11 .cse12 .cse16 .cse17 .cse4 .cse13 .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse18 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and (<= (+ ~local~0 1) ~token~0) .cse1 .cse14 .cse15 .cse11 .cse12 (< ~token~0 (+ ~local~0 2)) .cse3 .cse19 .cse4 .cse13) (and .cse1 .cse2 .cse15 .cse16 .cse3 .cse4 .cse5 .cse14 .cse7 .cse10 .cse11 .cse12 .cse17 .cse13) (and .cse0 .cse1 .cse2 .cse15 .cse16 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse17 .cse13) (and .cse0 .cse1 .cse2 .cse15 .cse18 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse1 .cse7 .cse2 .cse10 .cse11 .cse12 .cse4 .cse13 .cse18 .cse5) (and .cse1 .cse2 .cse15 .cse11 .cse12 .cse3 .cse4 .cse13 .cse18)))) [2020-11-28 03:05:52,765 INFO L270 CegarLoopResult]: At program point L473(lines 464 475) the Hoare annotation is: (= ~t1_i~0 1) [2020-11-28 03:05:52,765 INFO L274 CegarLoopResult]: For program point L12(line 12) no Hoare annotation was computed. [2020-11-28 03:05:52,765 INFO L274 CegarLoopResult]: For program point L311(lines 311 315) no Hoare annotation was computed. [2020-11-28 03:05:52,765 INFO L274 CegarLoopResult]: For program point L311-2(lines 311 315) no Hoare annotation was computed. [2020-11-28 03:05:52,765 INFO L274 CegarLoopResult]: For program point L311-3(lines 311 315) no Hoare annotation was computed. [2020-11-28 03:05:52,765 INFO L270 CegarLoopResult]: At program point L212(lines 202 240) the Hoare annotation is: (let ((.cse19 (= ~m_st~0 0)) (.cse14 (= ~t1_pc~0 1))) (let ((.cse16 (<= ~token~0 ~local~0)) (.cse17 (<= ~local~0 ~token~0)) (.cse0 (= |ULTIMATE.start_is_transmit1_triggered_#res| 0)) (.cse6 (not .cse14)) (.cse8 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse9 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse7 (= |ULTIMATE.start_is_master_triggered_#res| 0)) (.cse10 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse5 (= ~m_pc~0 0)) (.cse1 (not (= ~E_1~0 0))) (.cse2 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse15 (not (= ~E_1~0 1))) (.cse11 (not (= ~T1_E~0 1))) (.cse12 (= ~t1_i~0 1)) (.cse3 (not (= ~t1_st~0 0))) (.cse4 (not (= ~T1_E~0 0))) (.cse13 (<= 2 ~E_M~0)) (.cse18 (not .cse19))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse1 .cse14 .cse2 .cse15 .cse11 .cse12 .cse16 .cse17 .cse4 .cse13 .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse18 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and (<= (+ ~local~0 1) ~token~0) .cse1 .cse14 .cse15 .cse11 .cse12 (< ~token~0 (+ ~local~0 2)) .cse3 .cse19 .cse4 .cse13) (and .cse1 .cse2 .cse15 .cse16 .cse3 .cse4 .cse5 .cse14 .cse7 .cse10 .cse11 .cse12 .cse17 .cse13) (and .cse0 .cse1 .cse2 .cse15 .cse16 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse17 .cse13) (and .cse0 .cse1 .cse2 .cse15 .cse18 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse1 .cse7 .cse2 .cse10 .cse11 .cse12 .cse4 .cse13 .cse18 .cse5) (and .cse1 .cse2 .cse15 .cse11 .cse12 .cse3 .cse4 .cse13 .cse18)))) [2020-11-28 03:05:52,766 INFO L270 CegarLoopResult]: At program point L146(lines 134 148) the Hoare annotation is: (let ((.cse0 (= ~E_1~0 ~M_E~0)) (.cse1 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse2 (= ~T1_E~0 ~M_E~0)) (.cse3 (= ~M_E~0 2)) (.cse4 (= ~m_pc~0 0)) (.cse5 (= |ULTIMATE.start_is_master_triggered_#res| 0)) (.cse6 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse7 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse8 (= ~t1_st~0 0)) (.cse9 (= ~m_pc~0 ~t1_pc~0)) (.cse10 (= ~t1_i~0 1)) (.cse11 (<= 2 ~E_M~0))) (or (and .cse0 .cse1 .cse2 .cse3 (not (= ~m_st~0 0)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse2 (<= ~token~0 ~local~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= ~local~0 ~token~0) .cse11))) [2020-11-28 03:05:52,766 INFO L274 CegarLoopResult]: For program point L311-5(lines 311 315) no Hoare annotation was computed. [2020-11-28 03:05:52,766 INFO L270 CegarLoopResult]: At program point L146-1(lines 134 148) the Hoare annotation is: (let ((.cse4 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse1 (not (= ~E_1~0 0))) (.cse3 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse11 (not (= ~t1_st~0 0))) (.cse8 (not (= ~T1_E~0 0))) (.cse10 (not (= ~m_st~0 0))) (.cse0 (= ~t1_pc~0 1)) (.cse2 (= |ULTIMATE.start_is_master_triggered_#res| 0)) (.cse5 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse6 (not (= ~T1_E~0 1))) (.cse7 (= ~t1_i~0 1)) (.cse9 (<= 2 ~E_M~0))) (or (and (not .cse0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse1 .cse2 .cse3 .cse4 (not (= ~E_1~0 1)) .cse5 .cse6 .cse7 .cse11 .cse8 .cse9 .cse10) (and .cse1 .cse3 (<= ~token~0 ~local~0) .cse11 .cse8 .cse10 .cse0 .cse2 .cse5 .cse6 .cse7 (<= ~local~0 ~token~0) .cse9))) [2020-11-28 03:05:52,766 INFO L274 CegarLoopResult]: For program point L311-6(lines 311 315) no Hoare annotation was computed. [2020-11-28 03:05:52,766 INFO L274 CegarLoopResult]: For program point L80(lines 80 88) no Hoare annotation was computed. [2020-11-28 03:05:52,766 INFO L270 CegarLoopResult]: At program point L146-2(lines 134 148) the Hoare annotation is: (let ((.cse9 (= ~m_st~0 0))) (let ((.cse1 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse3 (not (= ~E_1~0 1))) (.cse6 (not (= ~t1_st~0 0))) (.cse0 (not (= ~E_1~0 0))) (.cse2 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse4 (not (= ~T1_E~0 1))) (.cse5 (= ~t1_i~0 1)) (.cse7 (not (= ~T1_E~0 0))) (.cse8 (not .cse9))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and (<= (+ ~local~0 1) ~token~0) .cse0 (= ~t1_pc~0 1) .cse1 .cse3 .cse4 .cse5 (< ~token~0 (+ ~local~0 2)) .cse6 .cse9 .cse7) (and .cse0 (= |ULTIMATE.start_is_master_triggered_#res| 0) .cse2 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0) .cse4 .cse5 .cse7 .cse8 (= ~m_pc~0 0))))) [2020-11-28 03:05:52,766 INFO L274 CegarLoopResult]: For program point L311-8(lines 311 315) no Hoare annotation was computed. [2020-11-28 03:05:52,766 INFO L270 CegarLoopResult]: At program point L146-3(lines 134 148) the Hoare annotation is: (let ((.cse16 (= ~t1_pc~0 1))) (let ((.cse4 (not (= ~t1_st~0 0))) (.cse15 (not .cse16)) (.cse2 (not (= ~E_1~0 1))) (.cse3 (<= ~token~0 ~local~0)) (.cse8 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse12 (<= ~local~0 ~token~0)) (.cse0 (not (= ~E_1~0 0))) (.cse7 (= |ULTIMATE.start_is_master_triggered_#res| 0)) (.cse1 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse9 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse10 (not (= ~T1_E~0 1))) (.cse11 (= ~t1_i~0 1)) (.cse14 (not (= ~m_st~0 0))) (.cse5 (not (= ~T1_E~0 0))) (.cse13 (<= 2 ~E_M~0)) (.cse6 (= ~m_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse7 .cse8 .cse1 .cse2 .cse9 .cse10 .cse11 .cse4 .cse14 .cse5 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse15 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse4 .cse5 (<= (+ ~local~0 1) ~token~0) .cse16 .cse7 .cse8 .cse9 .cse10 .cse11 (< ~token~0 (+ ~local~0 2)) .cse13) (and .cse15 .cse0 .cse7 .cse8 .cse1 .cse9 .cse10 .cse11 .cse4 .cse14 .cse5 .cse13) (and .cse0 .cse15 .cse7 .cse1 .cse8 .cse9 .cse10 .cse11 .cse4 .cse5 .cse6 .cse13) (and .cse0 .cse15 .cse7 .cse1 .cse8 .cse2 .cse9 .cse10 .cse11 .cse14 .cse5 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse14 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse7 .cse1 .cse9 .cse10 .cse11 .cse14 .cse5 .cse13 .cse6)))) [2020-11-28 03:05:52,766 INFO L274 CegarLoopResult]: For program point L311-9(lines 311 315) no Hoare annotation was computed. [2020-11-28 03:05:52,767 INFO L270 CegarLoopResult]: At program point L146-4(lines 134 148) the Hoare annotation is: (let ((.cse16 (= ~t1_pc~0 1))) (let ((.cse8 (not (= ~t1_st~0 0))) (.cse15 (not .cse16)) (.cse4 (not (= ~E_1~0 1))) (.cse12 (<= ~token~0 ~local~0)) (.cse2 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse14 (<= ~local~0 ~token~0)) (.cse0 (not (= ~E_1~0 0))) (.cse1 (= |ULTIMATE.start_is_master_triggered_#res| 0)) (.cse3 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse5 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse6 (not (= ~T1_E~0 1))) (.cse7 (= ~t1_i~0 1)) (.cse9 (not (= ~m_st~0 0))) (.cse10 (not (= ~T1_E~0 0))) (.cse11 (<= 2 ~E_M~0)) (.cse13 (= ~m_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse3 .cse4 .cse12 .cse8 .cse10 .cse13 .cse1 .cse2 .cse5 .cse6 .cse7 .cse14 .cse11) (and .cse0 .cse3 .cse4 .cse12 .cse10 .cse13 .cse15 .cse1 .cse2 .cse5 .cse6 .cse7 .cse14 .cse11) (and .cse0 .cse3 .cse4 .cse8 .cse10 (<= (+ ~local~0 1) ~token~0) .cse16 .cse1 .cse2 .cse5 .cse6 .cse7 (< ~token~0 (+ ~local~0 2)) .cse11) (and .cse15 .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse15 .cse1 .cse3 .cse2 .cse5 .cse6 .cse7 .cse8 .cse10 .cse13 .cse11) (and .cse0 .cse15 .cse1 .cse3 .cse2 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11) (and .cse0 .cse3 .cse4 .cse12 .cse9 .cse10 .cse1 .cse2 .cse5 .cse6 .cse7 .cse14 .cse11) (and .cse0 .cse1 .cse3 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse13)))) [2020-11-28 03:05:52,767 INFO L274 CegarLoopResult]: For program point L311-11(lines 311 315) no Hoare annotation was computed. [2020-11-28 03:05:52,767 INFO L274 CegarLoopResult]: For program point L311-12(lines 311 315) no Hoare annotation was computed. [2020-11-28 03:05:52,767 INFO L274 CegarLoopResult]: For program point L311-14(lines 311 315) no Hoare annotation was computed. [2020-11-28 03:05:52,767 INFO L270 CegarLoopResult]: At program point L345(lines 339 347) the Hoare annotation is: (let ((.cse17 (= ~t1_pc~0 1))) (let ((.cse3 (not (= ~t1_st~0 0))) (.cse16 (<= ~token~0 ~local~0)) (.cse18 (<= ~local~0 ~token~0)) (.cse0 (= |ULTIMATE.start_is_transmit1_triggered_#res| 0)) (.cse15 (not (= ~E_1~0 1))) (.cse6 (not .cse17)) (.cse8 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse9 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse1 (not (= ~E_1~0 0))) (.cse7 (= |ULTIMATE.start_is_master_triggered_#res| 0)) (.cse2 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse10 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse11 (not (= ~T1_E~0 1))) (.cse12 (= ~t1_i~0 1)) (.cse4 (not (= ~T1_E~0 0))) (.cse13 (<= 2 ~E_M~0)) (.cse14 (not (= ~m_st~0 0))) (.cse5 (= ~m_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse14 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse1 .cse2 .cse15 .cse16 .cse3 .cse4 .cse5 .cse17 .cse7 .cse10 .cse11 .cse12 .cse18 .cse13) (and .cse1 .cse7 .cse2 .cse15 .cse10 .cse11 .cse12 .cse3 .cse4 .cse13 .cse14) (and .cse1 .cse2 .cse15 .cse3 .cse4 (<= (+ ~local~0 1) ~token~0) .cse17 .cse7 .cse10 .cse11 .cse12 (< ~token~0 (+ ~local~0 2)) .cse13) (and .cse0 .cse1 .cse2 .cse15 .cse16 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse18 .cse13) (and .cse1 .cse2 .cse15 .cse16 .cse4 .cse14 .cse17 .cse7 .cse10 .cse11 .cse12 .cse18 .cse13) (and .cse0 .cse1 .cse2 .cse15 .cse14 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse1 .cse7 .cse2 .cse10 .cse11 .cse12 .cse4 .cse13 .cse14 .cse5)))) [2020-11-28 03:05:52,767 INFO L274 CegarLoopResult]: For program point L279-1(lines 278 301) no Hoare annotation was computed. [2020-11-28 03:05:52,767 INFO L274 CegarLoopResult]: For program point L180(lines 180 190) no Hoare annotation was computed. [2020-11-28 03:05:52,767 INFO L274 CegarLoopResult]: For program point L279-3(lines 278 301) no Hoare annotation was computed. [2020-11-28 03:05:52,768 INFO L270 CegarLoopResult]: At program point L147(lines 131 149) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_is_transmit1_triggered_#res| 0)) (.cse1 (= ~E_1~0 ~M_E~0)) (.cse2 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse3 (= ~T1_E~0 ~M_E~0)) (.cse4 (= ~M_E~0 2)) (.cse5 (= ~m_pc~0 0)) (.cse6 (= |ULTIMATE.start_is_master_triggered_#res| 0)) (.cse7 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse8 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse9 (= ~t1_st~0 0)) (.cse10 (= ~m_pc~0 ~t1_pc~0)) (.cse11 (= ~t1_i~0 1)) (.cse12 (<= 2 ~E_M~0))) (or (and .cse0 .cse1 .cse2 .cse3 (<= ~token~0 ~local~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (<= ~local~0 ~token~0) .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 (not (= ~m_st~0 0)) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12))) [2020-11-28 03:05:52,768 INFO L274 CegarLoopResult]: For program point L180-1(lines 180 190) no Hoare annotation was computed. [2020-11-28 03:05:52,768 INFO L270 CegarLoopResult]: At program point L147-1(lines 131 149) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_is_transmit1_triggered_#res| 0)) (.cse4 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse2 (not (= ~E_1~0 0))) (.cse5 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse12 (not (= ~t1_st~0 0))) (.cse9 (not (= ~T1_E~0 0))) (.cse11 (not (= ~m_st~0 0))) (.cse1 (= ~t1_pc~0 1)) (.cse3 (= |ULTIMATE.start_is_master_triggered_#res| 0)) (.cse6 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse7 (not (= ~T1_E~0 1))) (.cse8 (= ~t1_i~0 1)) (.cse10 (<= 2 ~E_M~0))) (or (and .cse0 (not .cse1) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse2 .cse5 (not (= ~E_1~0 1)) .cse12 .cse11 .cse9 .cse3 .cse4 .cse6 .cse7 .cse8 .cse10) (and .cse2 .cse5 (<= ~token~0 ~local~0) .cse12 .cse9 .cse11 .cse1 .cse3 .cse6 .cse7 .cse8 (<= ~local~0 ~token~0) .cse10))) [2020-11-28 03:05:52,768 INFO L274 CegarLoopResult]: For program point L180-2(lines 180 190) no Hoare annotation was computed. [2020-11-28 03:05:52,768 INFO L270 CegarLoopResult]: At program point L147-2(lines 131 149) the Hoare annotation is: (let ((.cse10 (= ~m_st~0 0))) (let ((.cse0 (= |ULTIMATE.start_is_transmit1_triggered_#res| 0)) (.cse2 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse4 (not (= ~E_1~0 1))) (.cse7 (not (= ~t1_st~0 0))) (.cse1 (not (= ~E_1~0 0))) (.cse3 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse5 (not (= ~T1_E~0 1))) (.cse6 (= ~t1_i~0 1)) (.cse8 (not (= ~T1_E~0 0))) (.cse9 (not .cse10))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 (<= (+ ~local~0 1) ~token~0) (= ~t1_pc~0 1) .cse2 .cse4 .cse5 .cse6 (< ~token~0 (+ ~local~0 2)) .cse7 .cse10 .cse8) (and .cse1 (= |ULTIMATE.start_is_master_triggered_#res| 0) .cse3 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0) .cse5 .cse6 .cse8 .cse9 (= ~m_pc~0 0))))) [2020-11-28 03:05:52,768 INFO L274 CegarLoopResult]: For program point L48(line 48) no Hoare annotation was computed. [2020-11-28 03:05:52,768 INFO L270 CegarLoopResult]: At program point L147-3(lines 131 149) the Hoare annotation is: (let ((.cse17 (= ~t1_pc~0 1))) (let ((.cse7 (not .cse17)) (.cse16 (not (= ~t1_st~0 0))) (.cse6 (= ~m_pc~0 0)) (.cse0 (= |ULTIMATE.start_is_transmit1_triggered_#res| 0)) (.cse1 (not (= ~E_1~0 0))) (.cse2 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse3 (not (= ~E_1~0 1))) (.cse4 (<= ~token~0 ~local~0)) (.cse15 (not (= ~m_st~0 0))) (.cse5 (not (= ~T1_E~0 0))) (.cse8 (= |ULTIMATE.start_is_master_triggered_#res| 0)) (.cse9 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse10 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse11 (not (= ~T1_E~0 1))) (.cse12 (= ~t1_i~0 1)) (.cse13 (<= ~local~0 ~token~0)) (.cse14 (<= 2 ~E_M~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse15 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse16 .cse5 (<= (+ ~local~0 1) ~token~0) .cse17 .cse8 .cse9 .cse10 .cse11 .cse12 (< ~token~0 (+ ~local~0 2)) .cse14) (and .cse0 .cse1 .cse2 .cse16 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse16 .cse15 .cse5 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14) (and .cse0 .cse1 .cse2 .cse16 .cse15 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse16 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse1 .cse8 .cse2 .cse10 .cse11 .cse12 .cse15 .cse5 .cse14 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse15 .cse5 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14)))) [2020-11-28 03:05:52,769 INFO L270 CegarLoopResult]: At program point L147-4(lines 131 149) the Hoare annotation is: (let ((.cse17 (= ~t1_pc~0 1))) (let ((.cse7 (not .cse17)) (.cse15 (not (= ~t1_st~0 0))) (.cse6 (= ~m_pc~0 0)) (.cse0 (= |ULTIMATE.start_is_transmit1_triggered_#res| 0)) (.cse1 (not (= ~E_1~0 0))) (.cse2 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse3 (not (= ~E_1~0 1))) (.cse4 (<= ~token~0 ~local~0)) (.cse16 (not (= ~m_st~0 0))) (.cse5 (not (= ~T1_E~0 0))) (.cse8 (= |ULTIMATE.start_is_master_triggered_#res| 0)) (.cse9 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse10 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse11 (not (= ~T1_E~0 1))) (.cse12 (= ~t1_i~0 1)) (.cse13 (<= ~local~0 ~token~0)) (.cse14 (<= 2 ~E_M~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse15 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse16 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse15 .cse5 (<= (+ ~local~0 1) ~token~0) .cse17 .cse8 .cse9 .cse10 .cse11 .cse12 (< ~token~0 (+ ~local~0 2)) .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse15 .cse16 .cse5 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14) (and .cse0 .cse1 .cse2 .cse15 .cse16 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse15 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse1 .cse8 .cse2 .cse10 .cse11 .cse12 .cse16 .cse5 .cse14 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse16 .cse5 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14)))) [2020-11-28 03:05:52,769 INFO L274 CegarLoopResult]: For program point L215(lines 215 222) no Hoare annotation was computed. [2020-11-28 03:05:52,769 INFO L274 CegarLoopResult]: For program point L116(lines 116 125) no Hoare annotation was computed. [2020-11-28 03:05:52,769 INFO L274 CegarLoopResult]: For program point L83(lines 83 87) no Hoare annotation was computed. [2020-11-28 03:05:52,769 INFO L274 CegarLoopResult]: For program point L116-2(lines 116 125) no Hoare annotation was computed. [2020-11-28 03:05:52,769 INFO L274 CegarLoopResult]: For program point L116-3(lines 116 125) no Hoare annotation was computed. [2020-11-28 03:05:52,769 INFO L274 CegarLoopResult]: For program point L116-5(lines 116 125) no Hoare annotation was computed. [2020-11-28 03:05:52,769 INFO L274 CegarLoopResult]: For program point L116-6(lines 116 125) no Hoare annotation was computed. [2020-11-28 03:05:52,769 INFO L274 CegarLoopResult]: For program point L116-8(lines 116 125) no Hoare annotation was computed. [2020-11-28 03:05:52,769 INFO L274 CegarLoopResult]: For program point L116-9(lines 116 125) no Hoare annotation was computed. [2020-11-28 03:05:52,769 INFO L274 CegarLoopResult]: For program point L116-11(lines 116 125) no Hoare annotation was computed. [2020-11-28 03:05:52,769 INFO L274 CegarLoopResult]: For program point L116-12(lines 116 125) no Hoare annotation was computed. [2020-11-28 03:05:52,769 INFO L274 CegarLoopResult]: For program point L116-14(lines 116 125) no Hoare annotation was computed. [2020-11-28 03:05:52,769 INFO L274 CegarLoopResult]: For program point L117(lines 117 122) no Hoare annotation was computed. [2020-11-28 03:05:52,769 INFO L274 CegarLoopResult]: For program point L117-1(lines 117 122) no Hoare annotation was computed. [2020-11-28 03:05:52,769 INFO L270 CegarLoopResult]: At program point L84(lines 79 110) the Hoare annotation is: (let ((.cse0 (not (= ~E_1~0 0))) (.cse1 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse2 (not (= ~T1_E~0 1))) (.cse3 (= ~t1_i~0 1)) (.cse4 (not (= ~T1_E~0 0))) (.cse5 (<= 2 ~E_M~0)) (.cse6 (not (= ~m_st~0 0)))) (or (and .cse0 (= ~t1_pc~0 1) .cse1 (not (= ~E_1~0 1)) .cse2 .cse3 (<= ~token~0 ~local~0) (not (= ~t1_st~0 0)) (<= ~local~0 ~token~0) .cse4 .cse5 .cse6) (and .cse0 (= |ULTIMATE.start_is_master_triggered_#res| 0) .cse1 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 (= ~m_pc~0 0)))) [2020-11-28 03:05:52,770 INFO L274 CegarLoopResult]: For program point L117-2(lines 117 122) no Hoare annotation was computed. [2020-11-28 03:05:52,770 INFO L274 CegarLoopResult]: For program point L117-3(lines 117 122) no Hoare annotation was computed. [2020-11-28 03:05:52,770 INFO L274 CegarLoopResult]: For program point L117-4(lines 117 122) no Hoare annotation was computed. [2020-11-28 03:05:52,770 INFO L274 CegarLoopResult]: For program point L184(lines 184 189) no Hoare annotation was computed. [2020-11-28 03:05:52,770 INFO L274 CegarLoopResult]: For program point L184-1(lines 184 189) no Hoare annotation was computed. [2020-11-28 03:05:52,770 INFO L274 CegarLoopResult]: For program point L184-2(lines 184 189) no Hoare annotation was computed. [2020-11-28 03:05:52,770 INFO L270 CegarLoopResult]: At program point L383(lines 376 385) the Hoare annotation is: (and (= ~E_1~0 ~M_E~0) (= ~t1_st~0 0) (= ~m_pc~0 ~t1_pc~0) (= ~T1_E~0 ~M_E~0) (<= ~token~0 ~local~0) (= ~M_E~0 2) (= ~t1_i~0 1) (= ~m_st~0 0) (<= ~local~0 ~token~0) (= ~m_pc~0 0) (<= 2 ~E_M~0)) [2020-11-28 03:05:52,770 INFO L274 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-11-28 03:05:52,770 INFO L274 CegarLoopResult]: For program point L284-1(lines 278 301) no Hoare annotation was computed. [2020-11-28 03:05:52,770 INFO L274 CegarLoopResult]: For program point L251-1(lines 250 273) no Hoare annotation was computed. [2020-11-28 03:05:52,771 INFO L274 CegarLoopResult]: For program point L251-2(lines 251 255) no Hoare annotation was computed. [2020-11-28 03:05:52,771 INFO L274 CegarLoopResult]: For program point L284-3(lines 278 301) no Hoare annotation was computed. [2020-11-28 03:05:52,771 INFO L274 CegarLoopResult]: For program point L251-4(lines 250 273) no Hoare annotation was computed. [2020-11-28 03:05:52,771 INFO L274 CegarLoopResult]: For program point L319(lines 319 323) no Hoare annotation was computed. [2020-11-28 03:05:52,771 INFO L274 CegarLoopResult]: For program point L352-1(lines 351 374) no Hoare annotation was computed. [2020-11-28 03:05:52,771 INFO L270 CegarLoopResult]: At program point L319-2(lines 279 283) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_is_transmit1_triggered_#res| 0)) (.cse1 (= ~E_1~0 ~M_E~0)) (.cse2 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse3 (= ~T1_E~0 ~M_E~0)) (.cse4 (= ~M_E~0 2)) (.cse5 (= ~m_pc~0 0)) (.cse6 (= |ULTIMATE.start_is_master_triggered_#res| 0)) (.cse7 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse8 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse9 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse10 (= ~t1_st~0 0)) (.cse11 (= ~m_pc~0 ~t1_pc~0)) (.cse12 (= ~t1_i~0 1)) (.cse13 (<= 2 ~E_M~0))) (or (and .cse0 .cse1 .cse2 .cse3 (<= ~token~0 ~local~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (<= ~local~0 ~token~0) .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 (not (= ~m_st~0 0)) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13))) [2020-11-28 03:05:52,771 INFO L274 CegarLoopResult]: For program point L319-3(lines 319 323) no Hoare annotation was computed. [2020-11-28 03:05:52,771 INFO L270 CegarLoopResult]: At program point L319-5(lines 1 475) the Hoare annotation is: (let ((.cse0 (not (= ~E_1~0 0))) (.cse3 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse7 (not (= ~T1_E~0 0))) (.cse8 (not (= ~m_st~0 0))) (.cse1 (= ~t1_pc~0 1)) (.cse2 (= |ULTIMATE.start_is_master_triggered_#res| 0)) (.cse4 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse5 (not (= ~T1_E~0 1))) (.cse6 (= ~t1_i~0 1)) (.cse9 (<= 2 ~E_M~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ~token~0 ~local~0) .cse6 (<= ~local~0 ~token~0) .cse7 .cse8 .cse9) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= ~t1_st~0 0)) .cse7 .cse9 .cse8) (and (= |ULTIMATE.start_is_transmit1_triggered_#res| 0) .cse0 .cse3 .cse7 .cse8 (not .cse1) .cse2 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0) (= ULTIMATE.start_activate_threads_~tmp___0~0 0) .cse4 .cse5 .cse6 .cse9))) [2020-11-28 03:05:52,771 INFO L274 CegarLoopResult]: For program point L319-6(lines 319 323) no Hoare annotation was computed. [2020-11-28 03:05:52,772 INFO L270 CegarLoopResult]: At program point L319-8(lines 1 475) the Hoare annotation is: (let ((.cse4 (= ~m_st~0 0))) (let ((.cse0 (not (= ~E_1~0 0))) (.cse6 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse1 (not (= ~E_1~0 1))) (.cse2 (not (= ~T1_E~0 1))) (.cse3 (= ~t1_i~0 1)) (.cse5 (not (= ~T1_E~0 0))) (.cse7 (not .cse4))) (or (and (<= (+ ~local~0 1) ~token~0) .cse0 (= ~t1_pc~0 1) .cse1 .cse2 .cse3 (< ~token~0 (+ ~local~0 2)) .cse4 .cse5) (and .cse0 (= |ULTIMATE.start_is_master_triggered_#res| 0) .cse6 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0) .cse2 .cse3 .cse5 (= ~m_pc~0 0) .cse7) (and .cse0 .cse6 .cse1 .cse2 .cse3 .cse5 .cse7)))) [2020-11-28 03:05:52,772 INFO L274 CegarLoopResult]: For program point L319-9(lines 319 323) no Hoare annotation was computed. [2020-11-28 03:05:52,772 INFO L270 CegarLoopResult]: At program point L319-11(lines 279 283) the Hoare annotation is: (let ((.cse17 (= ~t1_pc~0 1))) (let ((.cse3 (not (= ~t1_st~0 0))) (.cse16 (<= ~token~0 ~local~0)) (.cse18 (<= ~local~0 ~token~0)) (.cse0 (= |ULTIMATE.start_is_transmit1_triggered_#res| 0)) (.cse15 (not (= ~E_1~0 1))) (.cse6 (not .cse17)) (.cse8 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse9 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse1 (not (= ~E_1~0 0))) (.cse7 (= |ULTIMATE.start_is_master_triggered_#res| 0)) (.cse2 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse10 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse11 (not (= ~T1_E~0 1))) (.cse12 (= ~t1_i~0 1)) (.cse4 (not (= ~T1_E~0 0))) (.cse13 (<= 2 ~E_M~0)) (.cse14 (not (= ~m_st~0 0))) (.cse5 (= ~m_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse14 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse1 .cse2 .cse15 .cse16 .cse3 .cse4 .cse5 .cse17 .cse7 .cse10 .cse11 .cse12 .cse18 .cse13) (and .cse1 .cse7 .cse2 .cse15 .cse10 .cse11 .cse12 .cse3 .cse4 .cse13 .cse14) (and .cse1 .cse2 .cse15 .cse3 .cse4 (<= (+ ~local~0 1) ~token~0) .cse17 .cse7 .cse10 .cse11 .cse12 (< ~token~0 (+ ~local~0 2)) .cse13) (and .cse0 .cse1 .cse2 .cse15 .cse16 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse18 .cse13) (and .cse1 .cse2 .cse15 .cse16 .cse4 .cse14 .cse17 .cse7 .cse10 .cse11 .cse12 .cse18 .cse13) (and .cse0 .cse1 .cse2 .cse15 .cse14 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse1 .cse7 .cse2 .cse10 .cse11 .cse12 .cse4 .cse13 .cse14 .cse5)))) [2020-11-28 03:05:52,772 INFO L274 CegarLoopResult]: For program point L319-12(lines 319 323) no Hoare annotation was computed. [2020-11-28 03:05:52,773 INFO L270 CegarLoopResult]: At program point L319-14(lines 352 356) the Hoare annotation is: (let ((.cse17 (= ~t1_pc~0 1))) (let ((.cse3 (not (= ~t1_st~0 0))) (.cse16 (<= ~token~0 ~local~0)) (.cse18 (<= ~local~0 ~token~0)) (.cse0 (= |ULTIMATE.start_is_transmit1_triggered_#res| 0)) (.cse15 (not (= ~E_1~0 1))) (.cse6 (not .cse17)) (.cse8 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse9 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse1 (not (= ~E_1~0 0))) (.cse7 (= |ULTIMATE.start_is_master_triggered_#res| 0)) (.cse2 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse10 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse11 (not (= ~T1_E~0 1))) (.cse12 (= ~t1_i~0 1)) (.cse4 (not (= ~T1_E~0 0))) (.cse13 (<= 2 ~E_M~0)) (.cse14 (not (= ~m_st~0 0))) (.cse5 (= ~m_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse14 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse1 .cse2 .cse15 .cse16 .cse3 .cse4 .cse5 .cse17 .cse7 .cse10 .cse11 .cse12 .cse18 .cse13) (and .cse1 .cse7 .cse2 .cse15 .cse10 .cse11 .cse12 .cse3 .cse4 .cse13 .cse14) (and .cse1 .cse2 .cse15 .cse3 .cse4 (<= (+ ~local~0 1) ~token~0) .cse17 .cse7 .cse10 .cse11 .cse12 (< ~token~0 (+ ~local~0 2)) .cse13) (and .cse0 .cse1 .cse2 .cse15 .cse16 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse18 .cse13) (and .cse1 .cse2 .cse15 .cse16 .cse4 .cse14 .cse17 .cse7 .cse10 .cse11 .cse12 .cse18 .cse13) (and .cse0 .cse1 .cse2 .cse15 .cse14 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse1 .cse7 .cse2 .cse10 .cse11 .cse12 .cse4 .cse13 .cse14 .cse5)))) [2020-11-28 03:05:52,773 INFO L274 CegarLoopResult]: For program point L452(lines 452 456) no Hoare annotation was computed. [2020-11-28 03:05:52,773 INFO L270 CegarLoopResult]: At program point L155(lines 162 166) the Hoare annotation is: (and (= ~E_1~0 ~M_E~0) (= ~t1_st~0 0) (= ~m_pc~0 ~t1_pc~0) (= ~T1_E~0 ~M_E~0) (<= ~token~0 ~local~0) (= ~M_E~0 2) (= ~t1_i~0 1) (= ~m_st~0 0) (<= ~local~0 ~token~0) (= ~m_pc~0 0) (<= 2 ~E_M~0)) [2020-11-28 03:05:52,773 INFO L270 CegarLoopResult]: At program point L155-1(lines 150 157) the Hoare annotation is: (let ((.cse19 (= ~m_st~0 0)) (.cse14 (= ~t1_pc~0 1))) (let ((.cse16 (<= ~token~0 ~local~0)) (.cse17 (<= ~local~0 ~token~0)) (.cse0 (= |ULTIMATE.start_is_transmit1_triggered_#res| 0)) (.cse6 (not .cse14)) (.cse8 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse9 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse7 (= |ULTIMATE.start_is_master_triggered_#res| 0)) (.cse10 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse5 (= ~m_pc~0 0)) (.cse1 (not (= ~E_1~0 0))) (.cse2 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse15 (not (= ~E_1~0 1))) (.cse11 (not (= ~T1_E~0 1))) (.cse12 (= ~t1_i~0 1)) (.cse3 (not (= ~t1_st~0 0))) (.cse4 (not (= ~T1_E~0 0))) (.cse13 (<= 2 ~E_M~0)) (.cse18 (not .cse19))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse1 .cse14 .cse2 .cse15 .cse11 .cse12 .cse16 .cse17 .cse4 .cse13 .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse18 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and (<= (+ ~local~0 1) ~token~0) .cse1 .cse14 .cse15 .cse11 .cse12 (< ~token~0 (+ ~local~0 2)) .cse3 .cse19 .cse4 .cse13) (and .cse1 .cse2 .cse15 .cse16 .cse3 .cse4 .cse5 .cse14 .cse7 .cse10 .cse11 .cse12 .cse17 .cse13) (and .cse0 .cse1 .cse2 .cse15 .cse16 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse17 .cse13) (and .cse0 .cse1 .cse2 .cse15 .cse18 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse1 .cse7 .cse2 .cse10 .cse11 .cse12 .cse4 .cse13 .cse18 .cse5) (and .cse1 .cse2 .cse15 .cse11 .cse12 .cse3 .cse4 .cse13 .cse18)))) [2020-11-28 03:05:52,774 INFO L270 CegarLoopResult]: At program point L420-1(lines 275 457) the Hoare annotation is: (let ((.cse17 (= ~t1_pc~0 1))) (let ((.cse3 (not (= ~t1_st~0 0))) (.cse16 (<= ~token~0 ~local~0)) (.cse18 (<= ~local~0 ~token~0)) (.cse0 (= |ULTIMATE.start_is_transmit1_triggered_#res| 0)) (.cse15 (not (= ~E_1~0 1))) (.cse6 (not .cse17)) (.cse8 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse9 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse1 (not (= ~E_1~0 0))) (.cse7 (= |ULTIMATE.start_is_master_triggered_#res| 0)) (.cse2 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse10 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse11 (not (= ~T1_E~0 1))) (.cse12 (= ~t1_i~0 1)) (.cse4 (not (= ~T1_E~0 0))) (.cse13 (<= 2 ~E_M~0)) (.cse14 (not (= ~m_st~0 0))) (.cse5 (= ~m_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse14 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse1 .cse2 .cse15 .cse16 .cse3 .cse4 .cse5 .cse17 .cse7 .cse10 .cse11 .cse12 .cse18 .cse13) (and .cse1 .cse7 .cse2 .cse15 .cse10 .cse11 .cse12 .cse3 .cse4 .cse13 .cse14) (and .cse1 .cse2 .cse15 .cse3 .cse4 (<= (+ ~local~0 1) ~token~0) .cse17 .cse7 .cse10 .cse11 .cse12 (< ~token~0 (+ ~local~0 2)) .cse13) (and .cse0 .cse1 .cse2 .cse15 .cse16 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse18 .cse13) (and .cse1 .cse2 .cse15 .cse16 .cse4 .cse14 .cse17 .cse7 .cse10 .cse11 .cse12 .cse18 .cse13) (and .cse0 .cse1 .cse2 .cse15 .cse14 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse1 .cse7 .cse2 .cse10 .cse11 .cse12 .cse4 .cse13 .cse14 .cse5)))) [2020-11-28 03:05:52,774 INFO L274 CegarLoopResult]: For program point L421(line 421) no Hoare annotation was computed. [2020-11-28 03:05:52,774 INFO L274 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-11-28 03:05:52,774 INFO L274 CegarLoopResult]: For program point L289-1(lines 278 301) no Hoare annotation was computed. [2020-11-28 03:05:52,774 INFO L274 CegarLoopResult]: For program point L256-1(lines 250 273) no Hoare annotation was computed. [2020-11-28 03:05:52,774 INFO L274 CegarLoopResult]: For program point L289-3(lines 278 301) no Hoare annotation was computed. [2020-11-28 03:05:52,775 INFO L274 CegarLoopResult]: For program point L256-3(lines 250 273) no Hoare annotation was computed. [2020-11-28 03:05:52,775 INFO L270 CegarLoopResult]: At program point L91-1(lines 79 110) the Hoare annotation is: (let ((.cse10 (= ~m_st~0 0))) (let ((.cse3 (not (= ~E_1~0 1))) (.cse0 (not (= ~E_1~0 0))) (.cse1 (= |ULTIMATE.start_is_master_triggered_#res| 0)) (.cse2 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse4 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse5 (not (= ~T1_E~0 1))) (.cse6 (= ~t1_i~0 1)) (.cse7 (not (= ~T1_E~0 0))) (.cse8 (<= 2 ~E_M~0)) (.cse9 (= ~m_pc~0 0)) (.cse11 (not .cse10))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ~token~0 ~local~0) .cse6 (<= ~local~0 ~token~0) .cse7 .cse8 .cse9) (and (<= (+ ~local~0 1) ~token~0) .cse0 (= ~t1_pc~0 1) .cse3 .cse5 .cse6 (< ~token~0 (+ ~local~0 2)) .cse10 .cse7 .cse8) (and .cse0 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse11) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11)))) [2020-11-28 03:05:52,775 INFO L274 CegarLoopResult]: For program point L92(line 92) no Hoare annotation was computed. [2020-11-28 03:05:52,775 INFO L274 CegarLoopResult]: For program point L357-1(lines 351 374) no Hoare annotation was computed. [2020-11-28 03:05:52,776 INFO L270 CegarLoopResult]: At program point L192(lines 179 194) the Hoare annotation is: (let ((.cse19 (= ~m_st~0 0)) (.cse14 (= ~t1_pc~0 1))) (let ((.cse16 (<= ~token~0 ~local~0)) (.cse17 (<= ~local~0 ~token~0)) (.cse0 (= |ULTIMATE.start_is_transmit1_triggered_#res| 0)) (.cse6 (not .cse14)) (.cse8 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse9 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse7 (= |ULTIMATE.start_is_master_triggered_#res| 0)) (.cse10 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse5 (= ~m_pc~0 0)) (.cse1 (not (= ~E_1~0 0))) (.cse2 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse15 (not (= ~E_1~0 1))) (.cse11 (not (= ~T1_E~0 1))) (.cse12 (= ~t1_i~0 1)) (.cse3 (not (= ~t1_st~0 0))) (.cse4 (not (= ~T1_E~0 0))) (.cse13 (<= 2 ~E_M~0)) (.cse18 (not .cse19))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse1 .cse14 .cse2 .cse15 .cse11 .cse12 .cse16 .cse17 .cse4 .cse13 .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse18 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and (<= (+ ~local~0 1) ~token~0) .cse1 .cse14 .cse15 .cse11 .cse12 (< ~token~0 (+ ~local~0 2)) .cse3 .cse19 .cse4 .cse13) (and .cse1 .cse2 .cse15 .cse16 .cse3 .cse4 .cse5 .cse14 .cse7 .cse10 .cse11 .cse12 .cse17 .cse13) (and .cse0 .cse1 .cse2 .cse15 .cse16 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse17 .cse13) (and .cse0 .cse1 .cse2 .cse15 .cse18 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse1 .cse7 .cse2 .cse10 .cse11 .cse12 .cse4 .cse13 .cse18 .cse5) (and .cse1 .cse2 .cse15 .cse11 .cse12 .cse3 .cse4 .cse13 .cse18)))) [2020-11-28 03:05:52,776 INFO L270 CegarLoopResult]: At program point L192-1(lines 179 194) the Hoare annotation is: (let ((.cse17 (= ~t1_pc~0 1))) (let ((.cse3 (not (= ~t1_st~0 0))) (.cse16 (<= ~token~0 ~local~0)) (.cse18 (<= ~local~0 ~token~0)) (.cse0 (= |ULTIMATE.start_is_transmit1_triggered_#res| 0)) (.cse15 (not (= ~E_1~0 1))) (.cse6 (not .cse17)) (.cse8 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse9 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse1 (not (= ~E_1~0 0))) (.cse7 (= |ULTIMATE.start_is_master_triggered_#res| 0)) (.cse2 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse10 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse11 (not (= ~T1_E~0 1))) (.cse12 (= ~t1_i~0 1)) (.cse4 (not (= ~T1_E~0 0))) (.cse13 (<= 2 ~E_M~0)) (.cse14 (not (= ~m_st~0 0))) (.cse5 (= ~m_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse14 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse1 .cse2 .cse15 .cse16 .cse3 .cse4 .cse5 .cse17 .cse7 .cse10 .cse11 .cse12 .cse18 .cse13) (and .cse1 .cse7 .cse2 .cse15 .cse10 .cse11 .cse12 .cse3 .cse4 .cse13 .cse14) (and .cse1 .cse2 .cse15 .cse3 .cse4 (<= (+ ~local~0 1) ~token~0) .cse17 .cse7 .cse10 .cse11 .cse12 (< ~token~0 (+ ~local~0 2)) .cse13) (and .cse0 .cse1 .cse2 .cse15 .cse16 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse18 .cse13) (and .cse1 .cse2 .cse15 .cse16 .cse4 .cse14 .cse17 .cse7 .cse10 .cse11 .cse12 .cse18 .cse13) (and .cse0 .cse1 .cse2 .cse15 .cse14 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse1 .cse7 .cse2 .cse10 .cse11 .cse12 .cse4 .cse13 .cse14 .cse5)))) [2020-11-28 03:05:52,776 INFO L270 CegarLoopResult]: At program point L192-2(lines 179 194) the Hoare annotation is: (let ((.cse17 (= ~t1_pc~0 1))) (let ((.cse3 (not (= ~t1_st~0 0))) (.cse16 (<= ~token~0 ~local~0)) (.cse18 (<= ~local~0 ~token~0)) (.cse0 (= |ULTIMATE.start_is_transmit1_triggered_#res| 0)) (.cse15 (not (= ~E_1~0 1))) (.cse6 (not .cse17)) (.cse8 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse9 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse1 (not (= ~E_1~0 0))) (.cse7 (= |ULTIMATE.start_is_master_triggered_#res| 0)) (.cse2 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse10 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse11 (not (= ~T1_E~0 1))) (.cse12 (= ~t1_i~0 1)) (.cse4 (not (= ~T1_E~0 0))) (.cse13 (<= 2 ~E_M~0)) (.cse14 (not (= ~m_st~0 0))) (.cse5 (= ~m_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse14 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse1 .cse2 .cse15 .cse16 .cse3 .cse4 .cse5 .cse17 .cse7 .cse10 .cse11 .cse12 .cse18 .cse13) (and .cse1 .cse7 .cse2 .cse15 .cse10 .cse11 .cse12 .cse3 .cse4 .cse13 .cse14) (and .cse1 .cse2 .cse15 .cse3 .cse4 (<= (+ ~local~0 1) ~token~0) .cse17 .cse7 .cse10 .cse11 .cse12 (< ~token~0 (+ ~local~0 2)) .cse13) (and .cse0 .cse1 .cse2 .cse15 .cse16 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse18 .cse13) (and .cse1 .cse2 .cse15 .cse16 .cse4 .cse14 .cse17 .cse7 .cse10 .cse11 .cse12 .cse18 .cse13) (and .cse0 .cse1 .cse2 .cse15 .cse14 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse1 .cse7 .cse2 .cse10 .cse11 .cse12 .cse4 .cse13 .cse14 .cse5)))) [2020-11-28 03:05:52,777 INFO L270 CegarLoopResult]: At program point L226(lines 202 240) the Hoare annotation is: (let ((.cse19 (= ~m_st~0 0)) (.cse14 (= ~t1_pc~0 1))) (let ((.cse16 (<= ~token~0 ~local~0)) (.cse17 (<= ~local~0 ~token~0)) (.cse0 (= |ULTIMATE.start_is_transmit1_triggered_#res| 0)) (.cse6 (not .cse14)) (.cse8 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse9 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse7 (= |ULTIMATE.start_is_master_triggered_#res| 0)) (.cse10 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse5 (= ~m_pc~0 0)) (.cse1 (not (= ~E_1~0 0))) (.cse2 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse15 (not (= ~E_1~0 1))) (.cse11 (not (= ~T1_E~0 1))) (.cse12 (= ~t1_i~0 1)) (.cse3 (not (= ~t1_st~0 0))) (.cse4 (not (= ~T1_E~0 0))) (.cse13 (<= 2 ~E_M~0)) (.cse18 (not .cse19))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse1 .cse14 .cse2 .cse15 .cse11 .cse12 .cse16 .cse17 .cse4 .cse13 .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse18 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and (<= (+ ~local~0 1) ~token~0) .cse1 .cse14 .cse15 .cse11 .cse12 (< ~token~0 (+ ~local~0 2)) .cse3 .cse19 .cse4 .cse13) (and .cse1 .cse2 .cse15 .cse16 .cse3 .cse4 .cse5 .cse14 .cse7 .cse10 .cse11 .cse12 .cse17 .cse13) (and .cse0 .cse1 .cse2 .cse15 .cse16 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse17 .cse13) (and .cse0 .cse1 .cse2 .cse15 .cse18 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse1 .cse7 .cse2 .cse10 .cse11 .cse12 .cse4 .cse13 .cse18 .cse5) (and .cse1 .cse2 .cse15 .cse11 .cse12 .cse3 .cse4 .cse13 .cse18)))) [2020-11-28 03:05:52,777 INFO L270 CegarLoopResult]: At program point L193(lines 176 195) the Hoare annotation is: (let ((.cse19 (= ~m_st~0 0)) (.cse14 (= ~t1_pc~0 1))) (let ((.cse16 (<= ~token~0 ~local~0)) (.cse17 (<= ~local~0 ~token~0)) (.cse0 (= |ULTIMATE.start_is_transmit1_triggered_#res| 0)) (.cse6 (not .cse14)) (.cse8 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse9 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse7 (= |ULTIMATE.start_is_master_triggered_#res| 0)) (.cse10 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse5 (= ~m_pc~0 0)) (.cse1 (not (= ~E_1~0 0))) (.cse2 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse15 (not (= ~E_1~0 1))) (.cse11 (not (= ~T1_E~0 1))) (.cse12 (= ~t1_i~0 1)) (.cse3 (not (= ~t1_st~0 0))) (.cse4 (not (= ~T1_E~0 0))) (.cse13 (<= 2 ~E_M~0)) (.cse18 (not .cse19))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse1 .cse14 .cse2 .cse15 .cse11 .cse12 .cse16 .cse17 .cse4 .cse13 .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse18 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and (<= (+ ~local~0 1) ~token~0) .cse1 .cse14 .cse15 .cse11 .cse12 (< ~token~0 (+ ~local~0 2)) .cse3 .cse19 .cse4 .cse13) (and .cse1 .cse2 .cse15 .cse16 .cse3 .cse4 .cse5 .cse14 .cse7 .cse10 .cse11 .cse12 .cse17 .cse13) (and .cse0 .cse1 .cse2 .cse15 .cse16 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse17 .cse13) (and .cse0 .cse1 .cse2 .cse15 .cse18 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse1 .cse7 .cse2 .cse10 .cse11 .cse12 .cse4 .cse13 .cse18 .cse5) (and .cse1 .cse2 .cse15 .cse11 .cse12 .cse3 .cse4 .cse13 .cse18)))) [2020-11-28 03:05:52,778 INFO L270 CegarLoopResult]: At program point L193-1(lines 176 195) the Hoare annotation is: (let ((.cse17 (= ~t1_pc~0 1))) (let ((.cse3 (not (= ~t1_st~0 0))) (.cse16 (<= ~token~0 ~local~0)) (.cse18 (<= ~local~0 ~token~0)) (.cse0 (= |ULTIMATE.start_is_transmit1_triggered_#res| 0)) (.cse15 (not (= ~E_1~0 1))) (.cse6 (not .cse17)) (.cse8 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse9 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse1 (not (= ~E_1~0 0))) (.cse7 (= |ULTIMATE.start_is_master_triggered_#res| 0)) (.cse2 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse10 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse11 (not (= ~T1_E~0 1))) (.cse12 (= ~t1_i~0 1)) (.cse4 (not (= ~T1_E~0 0))) (.cse13 (<= 2 ~E_M~0)) (.cse14 (not (= ~m_st~0 0))) (.cse5 (= ~m_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse14 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse1 .cse2 .cse15 .cse16 .cse3 .cse4 .cse5 .cse17 .cse7 .cse10 .cse11 .cse12 .cse18 .cse13) (and .cse1 .cse7 .cse2 .cse15 .cse10 .cse11 .cse12 .cse3 .cse4 .cse13 .cse14) (and .cse1 .cse2 .cse15 .cse3 .cse4 (<= (+ ~local~0 1) ~token~0) .cse17 .cse7 .cse10 .cse11 .cse12 (< ~token~0 (+ ~local~0 2)) .cse13) (and .cse0 .cse1 .cse2 .cse15 .cse16 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse18 .cse13) (and .cse1 .cse2 .cse15 .cse16 .cse4 .cse14 .cse17 .cse7 .cse10 .cse11 .cse12 .cse18 .cse13) (and .cse0 .cse1 .cse2 .cse15 .cse14 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse1 .cse7 .cse2 .cse10 .cse11 .cse12 .cse4 .cse13 .cse14 .cse5)))) [2020-11-28 03:05:52,778 INFO L270 CegarLoopResult]: At program point L127(lines 115 129) the Hoare annotation is: (let ((.cse0 (= ~E_1~0 ~M_E~0)) (.cse1 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse2 (= ~t1_st~0 0)) (.cse3 (= ~m_pc~0 ~t1_pc~0)) (.cse4 (= ~T1_E~0 ~M_E~0)) (.cse5 (= ~M_E~0 2)) (.cse6 (= ~t1_i~0 1)) (.cse7 (= ~m_pc~0 0)) (.cse8 (<= 2 ~E_M~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= ~m_st~0 0)) .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= ~token~0 ~local~0) .cse5 .cse6 (<= ~local~0 ~token~0) .cse7 .cse8))) [2020-11-28 03:05:52,778 INFO L270 CegarLoopResult]: At program point L193-2(lines 176 195) the Hoare annotation is: (let ((.cse17 (= ~t1_pc~0 1))) (let ((.cse3 (not (= ~t1_st~0 0))) (.cse16 (<= ~token~0 ~local~0)) (.cse18 (<= ~local~0 ~token~0)) (.cse0 (= |ULTIMATE.start_is_transmit1_triggered_#res| 0)) (.cse15 (not (= ~E_1~0 1))) (.cse6 (not .cse17)) (.cse8 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse9 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse1 (not (= ~E_1~0 0))) (.cse7 (= |ULTIMATE.start_is_master_triggered_#res| 0)) (.cse2 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse10 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse11 (not (= ~T1_E~0 1))) (.cse12 (= ~t1_i~0 1)) (.cse4 (not (= ~T1_E~0 0))) (.cse13 (<= 2 ~E_M~0)) (.cse14 (not (= ~m_st~0 0))) (.cse5 (= ~m_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse14 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse1 .cse2 .cse15 .cse16 .cse3 .cse4 .cse5 .cse17 .cse7 .cse10 .cse11 .cse12 .cse18 .cse13) (and .cse1 .cse7 .cse2 .cse15 .cse10 .cse11 .cse12 .cse3 .cse4 .cse13 .cse14) (and .cse1 .cse2 .cse15 .cse3 .cse4 (<= (+ ~local~0 1) ~token~0) .cse17 .cse7 .cse10 .cse11 .cse12 (< ~token~0 (+ ~local~0 2)) .cse13) (and .cse0 .cse1 .cse2 .cse15 .cse16 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse18 .cse13) (and .cse1 .cse2 .cse15 .cse16 .cse4 .cse14 .cse17 .cse7 .cse10 .cse11 .cse12 .cse18 .cse13) (and .cse0 .cse1 .cse2 .cse15 .cse14 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse1 .cse7 .cse2 .cse10 .cse11 .cse12 .cse4 .cse13 .cse14 .cse5)))) [2020-11-28 03:05:52,779 INFO L270 CegarLoopResult]: At program point L127-1(lines 115 129) the Hoare annotation is: (let ((.cse1 (not (= ~E_1~0 0))) (.cse0 (= ~t1_pc~0 1)) (.cse2 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse3 (not (= ~T1_E~0 1))) (.cse4 (= ~t1_i~0 1)) (.cse5 (not (= ~T1_E~0 0))) (.cse6 (<= 2 ~E_M~0)) (.cse7 (not (= ~m_st~0 0)))) (or (and (= |ULTIMATE.start_is_transmit1_triggered_#res| 0) (not .cse0) .cse1 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse1 .cse0 .cse2 .cse3 (<= ~token~0 ~local~0) .cse4 (not (= ~t1_st~0 0)) (<= ~local~0 ~token~0) .cse5 .cse6 .cse7))) [2020-11-28 03:05:52,779 INFO L270 CegarLoopResult]: At program point L61(lines 35 74) the Hoare annotation is: (let ((.cse16 (= ~t1_pc~0 1))) (let ((.cse0 (= |ULTIMATE.start_is_transmit1_triggered_#res| 0)) (.cse2 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse6 (not .cse16)) (.cse7 (= |ULTIMATE.start_is_master_triggered_#res| 0)) (.cse8 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse9 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse10 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse15 (= ~m_pc~0 0)) (.cse1 (not (= ~E_1~0 0))) (.cse14 (not (= ~E_1~0 1))) (.cse11 (not (= ~T1_E~0 1))) (.cse12 (= ~t1_i~0 1)) (.cse3 (not (= ~t1_st~0 0))) (.cse5 (not (= ~T1_E~0 0))) (.cse13 (<= 2 ~E_M~0)) (.cse4 (not (= ~m_st~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse14 .cse5 .cse15 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse1 .cse16 .cse14 .cse11 .cse12 (<= ~token~0 ~local~0) .cse3 (<= ~local~0 ~token~0) .cse5 .cse13 .cse15 .cse4) (and (<= (+ ~local~0 1) ~token~0) .cse1 .cse16 .cse14 .cse11 .cse12 (< ~token~0 (+ ~local~0 2)) .cse3 .cse5 .cse13 .cse4)))) [2020-11-28 03:05:52,779 INFO L270 CegarLoopResult]: At program point L127-2(lines 115 129) the Hoare annotation is: (let ((.cse1 (not (= ~E_1~0 1))) (.cse4 (not (= ~t1_st~0 0))) (.cse0 (not (= ~E_1~0 0))) (.cse7 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse2 (not (= ~T1_E~0 1))) (.cse3 (= ~t1_i~0 1)) (.cse5 (not (= ~T1_E~0 0))) (.cse6 (not (= ~m_st~0 0)))) (or (and .cse0 (<= (+ ~local~0 1) ~token~0) (= ~t1_pc~0 1) .cse1 .cse2 .cse3 (< ~token~0 (+ ~local~0 2)) .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse7 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse7 .cse2 .cse3 .cse5 .cse6 (= ~m_pc~0 0)))) [2020-11-28 03:05:52,779 INFO L274 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-11-28 03:05:52,780 INFO L270 CegarLoopResult]: At program point L127-3(lines 115 129) the Hoare annotation is: (let ((.cse1 (= ~t1_pc~0 1))) (let ((.cse11 (= |ULTIMATE.start_is_transmit1_triggered_#res| 0)) (.cse12 (not .cse1)) (.cse13 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse10 (not (= ~m_st~0 0))) (.cse0 (not (= ~E_1~0 0))) (.cse2 (not (= ~E_1~0 1))) (.cse3 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse4 (not (= ~T1_E~0 1))) (.cse5 (= ~t1_i~0 1)) (.cse6 (<= ~token~0 ~local~0)) (.cse14 (not (= ~t1_st~0 0))) (.cse7 (<= ~local~0 ~token~0)) (.cse8 (not (= ~T1_E~0 0))) (.cse9 (<= 2 ~E_M~0)) (.cse15 (= ~m_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse12 .cse0 .cse13 .cse3 .cse4 .cse5 .cse14 .cse8 .cse9 .cse15) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse14 .cse8 .cse9 .cse10) (and .cse11 .cse12 .cse0 .cse13 .cse2 .cse3 .cse4 .cse5 .cse10 .cse8 .cse9) (and .cse0 .cse3 .cse4 .cse5 .cse8 .cse9 .cse10 .cse15) (and .cse11 .cse0 .cse2 .cse6 .cse8 .cse15 .cse12 .cse13 .cse3 .cse4 .cse5 .cse7 .cse9) (and (<= (+ ~local~0 1) ~token~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (< ~token~0 (+ ~local~0 2)) .cse14 .cse8 .cse9) (and .cse11 .cse12 .cse0 .cse13 .cse3 .cse4 .cse5 .cse14 .cse10 .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse14 .cse7 .cse8 .cse9 .cse15)))) [2020-11-28 03:05:52,780 INFO L270 CegarLoopResult]: At program point L127-4(lines 115 129) the Hoare annotation is: (let ((.cse1 (= ~t1_pc~0 1))) (let ((.cse12 (= |ULTIMATE.start_is_transmit1_triggered_#res| 0)) (.cse13 (not .cse1)) (.cse14 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse10 (not (= ~m_st~0 0))) (.cse0 (not (= ~E_1~0 0))) (.cse2 (not (= ~E_1~0 1))) (.cse3 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse4 (not (= ~T1_E~0 1))) (.cse5 (= ~t1_i~0 1)) (.cse6 (<= ~token~0 ~local~0)) (.cse11 (not (= ~t1_st~0 0))) (.cse7 (<= ~local~0 ~token~0)) (.cse8 (not (= ~T1_E~0 0))) (.cse9 (<= 2 ~E_M~0)) (.cse15 (= ~m_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse11 .cse8 .cse9 .cse10) (and .cse12 .cse13 .cse0 .cse14 .cse3 .cse4 .cse5 .cse11 .cse8 .cse9 .cse15) (and .cse12 .cse13 .cse0 .cse14 .cse2 .cse3 .cse4 .cse5 .cse10 .cse8 .cse9) (and .cse0 .cse3 .cse4 .cse5 .cse8 .cse9 .cse10 .cse15) (and .cse12 .cse0 .cse2 .cse6 .cse8 .cse15 .cse13 .cse14 .cse3 .cse4 .cse5 .cse7 .cse9) (and (<= (+ ~local~0 1) ~token~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (< ~token~0 (+ ~local~0 2)) .cse11 .cse8 .cse9) (and .cse12 .cse13 .cse0 .cse14 .cse3 .cse4 .cse5 .cse11 .cse10 .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse11 .cse7 .cse8 .cse9 .cse15)))) [2020-11-28 03:05:52,780 INFO L270 CegarLoopResult]: At program point L458(lines 405 463) the Hoare annotation is: (= ~t1_i~0 1) [2020-11-28 03:05:52,780 INFO L270 CegarLoopResult]: At program point L128(lines 112 130) the Hoare annotation is: (let ((.cse0 (= ~E_1~0 ~M_E~0)) (.cse1 (= |ULTIMATE.start_is_master_triggered_#res| 0)) (.cse2 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse3 (= ~t1_st~0 0)) (.cse4 (= ~m_pc~0 ~t1_pc~0)) (.cse5 (= ~T1_E~0 ~M_E~0)) (.cse6 (= ~M_E~0 2)) (.cse7 (= ~t1_i~0 1)) (.cse8 (= ~m_pc~0 0)) (.cse9 (<= 2 ~E_M~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= ~m_st~0 0)) .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ~token~0 ~local~0) .cse6 .cse7 (<= ~local~0 ~token~0) .cse8 .cse9))) [2020-11-28 03:05:52,781 INFO L270 CegarLoopResult]: At program point L128-1(lines 112 130) the Hoare annotation is: (let ((.cse1 (= ~t1_pc~0 1)) (.cse0 (not (= ~E_1~0 0))) (.cse2 (= |ULTIMATE.start_is_master_triggered_#res| 0)) (.cse3 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse4 (not (= ~T1_E~0 1))) (.cse5 (= ~t1_i~0 1)) (.cse6 (not (= ~T1_E~0 0))) (.cse7 (<= 2 ~E_M~0)) (.cse8 (not (= ~m_st~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= ~token~0 ~local~0) .cse5 (not (= ~t1_st~0 0)) (<= ~local~0 ~token~0) .cse6 .cse7 .cse8) (and (= |ULTIMATE.start_is_transmit1_triggered_#res| 0) (not .cse1) .cse0 .cse2 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8))) [2020-11-28 03:05:52,781 INFO L270 CegarLoopResult]: At program point L128-2(lines 112 130) the Hoare annotation is: (let ((.cse0 (not (= ~E_1~0 0))) (.cse7 (= |ULTIMATE.start_is_master_triggered_#res| 0)) (.cse1 (not (= ~E_1~0 1))) (.cse8 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse2 (not (= ~T1_E~0 1))) (.cse3 (= ~t1_i~0 1)) (.cse4 (not (= ~t1_st~0 0))) (.cse5 (not (= ~T1_E~0 0))) (.cse6 (not (= ~m_st~0 0)))) (or (and .cse0 (<= (+ ~local~0 1) ~token~0) (= ~t1_pc~0 1) .cse1 .cse2 .cse3 (< ~token~0 (+ ~local~0 2)) .cse4 .cse5 .cse6) (and .cse0 .cse7 .cse8 .cse2 .cse3 .cse5 .cse6 (= ~m_pc~0 0)) (and .cse0 .cse7 .cse1 .cse8 .cse2 .cse3 .cse4 .cse5 .cse6))) [2020-11-28 03:05:52,781 INFO L270 CegarLoopResult]: At program point L128-3(lines 112 130) the Hoare annotation is: (let ((.cse1 (= ~t1_pc~0 1))) (let ((.cse12 (= |ULTIMATE.start_is_transmit1_triggered_#res| 0)) (.cse13 (not .cse1)) (.cse14 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse6 (<= ~token~0 ~local~0)) (.cse16 (= ~m_pc~0 0)) (.cse8 (<= ~local~0 ~token~0)) (.cse10 (not (= ~m_st~0 0))) (.cse0 (not (= ~E_1~0 0))) (.cse2 (= |ULTIMATE.start_is_master_triggered_#res| 0)) (.cse3 (not (= ~E_1~0 1))) (.cse4 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse5 (not (= ~T1_E~0 1))) (.cse7 (= ~t1_i~0 1)) (.cse15 (not (= ~t1_st~0 0))) (.cse9 (not (= ~T1_E~0 0))) (.cse11 (<= 2 ~E_M~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse12 .cse0 .cse13 .cse2 .cse14 .cse4 .cse5 .cse7 .cse15 .cse9 .cse16 .cse11) (and .cse12 .cse13 .cse0 .cse2 .cse14 .cse4 .cse5 .cse7 .cse15 .cse10 .cse9 .cse11) (and .cse12 .cse0 .cse13 .cse2 .cse14 .cse3 .cse4 .cse5 .cse7 .cse10 .cse9 .cse11) (and .cse0 .cse2 .cse4 .cse5 .cse7 .cse9 .cse11 .cse10 .cse16) (and .cse12 .cse0 .cse3 .cse6 .cse9 .cse16 .cse13 .cse2 .cse14 .cse4 .cse5 .cse7 .cse8 .cse11) (and .cse0 .cse3 .cse6 .cse15 .cse9 .cse16 .cse1 .cse2 .cse4 .cse5 .cse7 .cse8 .cse11) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse7 .cse15 .cse9 .cse11 .cse10) (and (<= (+ ~local~0 1) ~token~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 (< ~token~0 (+ ~local~0 2)) .cse15 .cse9 .cse11)))) [2020-11-28 03:05:52,782 INFO L270 CegarLoopResult]: At program point L128-4(lines 112 130) the Hoare annotation is: (let ((.cse1 (= ~t1_pc~0 1))) (let ((.cse12 (= |ULTIMATE.start_is_transmit1_triggered_#res| 0)) (.cse13 (not .cse1)) (.cse14 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse6 (<= ~token~0 ~local~0)) (.cse16 (= ~m_pc~0 0)) (.cse8 (<= ~local~0 ~token~0)) (.cse10 (not (= ~m_st~0 0))) (.cse0 (not (= ~E_1~0 0))) (.cse2 (= |ULTIMATE.start_is_master_triggered_#res| 0)) (.cse3 (not (= ~E_1~0 1))) (.cse4 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse5 (not (= ~T1_E~0 1))) (.cse7 (= ~t1_i~0 1)) (.cse15 (not (= ~t1_st~0 0))) (.cse9 (not (= ~T1_E~0 0))) (.cse11 (<= 2 ~E_M~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse12 .cse0 .cse13 .cse2 .cse14 .cse4 .cse5 .cse7 .cse15 .cse9 .cse16 .cse11) (and .cse12 .cse13 .cse0 .cse2 .cse14 .cse4 .cse5 .cse7 .cse15 .cse10 .cse9 .cse11) (and .cse12 .cse0 .cse13 .cse2 .cse14 .cse3 .cse4 .cse5 .cse7 .cse10 .cse9 .cse11) (and .cse0 .cse2 .cse4 .cse5 .cse7 .cse9 .cse11 .cse10 .cse16) (and .cse12 .cse0 .cse3 .cse6 .cse9 .cse16 .cse13 .cse2 .cse14 .cse4 .cse5 .cse7 .cse8 .cse11) (and .cse0 .cse3 .cse6 .cse15 .cse9 .cse16 .cse1 .cse2 .cse4 .cse5 .cse7 .cse8 .cse11) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse7 .cse15 .cse9 .cse11 .cse10) (and (<= (+ ~local~0 1) ~token~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 (< ~token~0 (+ ~local~0 2)) .cse15 .cse9 .cse11)))) [2020-11-28 03:05:52,782 INFO L274 CegarLoopResult]: For program point L261-1(lines 250 273) no Hoare annotation was computed. [2020-11-28 03:05:52,782 INFO L270 CegarLoopResult]: At program point L294-3(lines 275 302) the Hoare annotation is: (let ((.cse17 (= ~t1_pc~0 1))) (let ((.cse3 (not (= ~t1_st~0 0))) (.cse16 (<= ~token~0 ~local~0)) (.cse18 (<= ~local~0 ~token~0)) (.cse0 (= |ULTIMATE.start_is_transmit1_triggered_#res| 0)) (.cse15 (not (= ~E_1~0 1))) (.cse6 (not .cse17)) (.cse8 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse9 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse1 (not (= ~E_1~0 0))) (.cse7 (= |ULTIMATE.start_is_master_triggered_#res| 0)) (.cse2 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse10 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse11 (not (= ~T1_E~0 1))) (.cse12 (= ~t1_i~0 1)) (.cse4 (not (= ~T1_E~0 0))) (.cse13 (<= 2 ~E_M~0)) (.cse14 (not (= ~m_st~0 0))) (.cse5 (= ~m_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse14 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse1 .cse2 .cse15 .cse16 .cse3 .cse4 .cse5 .cse17 .cse7 .cse10 .cse11 .cse12 .cse18 .cse13) (and .cse1 .cse7 .cse2 .cse15 .cse10 .cse11 .cse12 .cse3 .cse4 .cse13 .cse14) (and .cse1 .cse2 .cse15 .cse3 .cse4 (<= (+ ~local~0 1) ~token~0) .cse17 .cse7 .cse10 .cse11 .cse12 (< ~token~0 (+ ~local~0 2)) .cse13) (and .cse0 .cse1 .cse2 .cse15 .cse16 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse18 .cse13) (and .cse1 .cse2 .cse15 .cse16 .cse4 .cse14 .cse17 .cse7 .cse10 .cse11 .cse12 .cse18 .cse13) (and .cse0 .cse1 .cse2 .cse15 .cse14 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse1 .cse7 .cse2 .cse10 .cse11 .cse12 .cse4 .cse13 .cse14 .cse5)))) [2020-11-28 03:05:52,782 INFO L274 CegarLoopResult]: For program point L261-3(lines 250 273) no Hoare annotation was computed. [2020-11-28 03:05:52,783 INFO L274 CegarLoopResult]: For program point L162-1(lines 161 174) no Hoare annotation was computed. [2020-11-28 03:05:52,783 INFO L274 CegarLoopResult]: For program point L394(lines 394 399) no Hoare annotation was computed. [2020-11-28 03:05:52,783 INFO L274 CegarLoopResult]: For program point L229(lines 229 236) no Hoare annotation was computed. [2020-11-28 03:05:52,783 INFO L274 CegarLoopResult]: For program point L362-1(lines 351 374) no Hoare annotation was computed. [2020-11-28 03:05:52,783 INFO L274 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2020-11-28 03:05:52,783 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 3) no Hoare annotation was computed. [2020-11-28 03:05:52,784 INFO L270 CegarLoopResult]: At program point L266-1(lines 247 274) the Hoare annotation is: (let ((.cse0 (= ~E_1~0 ~M_E~0)) (.cse1 (= ~t1_st~0 0)) (.cse2 (= ~m_pc~0 ~t1_pc~0)) (.cse3 (= ~T1_E~0 ~M_E~0)) (.cse4 (= ~M_E~0 2)) (.cse5 (= ~t1_i~0 1)) (.cse6 (= ~m_pc~0 0)) (.cse7 (<= 2 ~E_M~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= ~m_st~0 0)) .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 (<= ~token~0 ~local~0) .cse4 .cse5 (<= ~local~0 ~token~0) .cse6 .cse7))) [2020-11-28 03:05:52,784 INFO L270 CegarLoopResult]: At program point L266-3(lines 247 274) the Hoare annotation is: (let ((.cse19 (= ~m_st~0 0)) (.cse14 (= ~t1_pc~0 1))) (let ((.cse16 (<= ~token~0 ~local~0)) (.cse17 (<= ~local~0 ~token~0)) (.cse0 (= |ULTIMATE.start_is_transmit1_triggered_#res| 0)) (.cse6 (not .cse14)) (.cse8 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse9 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse7 (= |ULTIMATE.start_is_master_triggered_#res| 0)) (.cse10 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse5 (= ~m_pc~0 0)) (.cse1 (not (= ~E_1~0 0))) (.cse2 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse15 (not (= ~E_1~0 1))) (.cse11 (not (= ~T1_E~0 1))) (.cse12 (= ~t1_i~0 1)) (.cse3 (not (= ~t1_st~0 0))) (.cse4 (not (= ~T1_E~0 0))) (.cse13 (<= 2 ~E_M~0)) (.cse18 (not .cse19))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse1 .cse14 .cse2 .cse15 .cse11 .cse12 .cse16 .cse17 .cse4 .cse13 .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse18 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and (<= (+ ~local~0 1) ~token~0) .cse1 .cse14 .cse15 .cse11 .cse12 (< ~token~0 (+ ~local~0 2)) .cse3 .cse19 .cse4 .cse13) (and .cse1 .cse2 .cse15 .cse16 .cse3 .cse4 .cse5 .cse14 .cse7 .cse10 .cse11 .cse12 .cse17 .cse13) (and .cse0 .cse1 .cse2 .cse15 .cse16 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse17 .cse13) (and .cse0 .cse1 .cse2 .cse15 .cse18 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse1 .cse7 .cse2 .cse10 .cse11 .cse12 .cse4 .cse13 .cse18 .cse5) (and .cse1 .cse2 .cse15 .cse11 .cse12 .cse3 .cse4 .cse13 .cse18)))) [2020-11-28 03:05:52,784 INFO L270 CegarLoopResult]: At program point L167-1(lines 251 255) the Hoare annotation is: (let ((.cse0 (= ~E_1~0 ~M_E~0)) (.cse1 (= ~t1_st~0 0)) (.cse2 (= ~m_pc~0 ~t1_pc~0)) (.cse3 (= ~T1_E~0 ~M_E~0)) (.cse4 (= ~M_E~0 2)) (.cse5 (= ~t1_i~0 1)) (.cse6 (= ~m_pc~0 0)) (.cse7 (<= 2 ~E_M~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= ~m_st~0 0)) .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 (<= ~token~0 ~local~0) .cse4 .cse5 (<= ~local~0 ~token~0) .cse6 .cse7))) [2020-11-28 03:05:52,936 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 03:05:52 BoogieIcfgContainer [2020-11-28 03:05:52,936 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-28 03:05:52,937 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-28 03:05:52,937 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-28 03:05:52,937 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-28 03:05:52,938 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:05:27" (3/4) ... [2020-11-28 03:05:52,941 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-11-28 03:05:52,968 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2020-11-28 03:05:52,970 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2020-11-28 03:05:52,971 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-11-28 03:05:52,971 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-11-28 03:05:53,006 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((E_1 == M_E && \result == 0) && __retres1 == 0) && t1_st == 0) && m_pc == t1_pc) && T1_E == M_E) && M_E == 2) && t1_i == 1) && !(m_st == 0)) && m_pc == 0) && 2 <= E_M) || (((((((((((E_1 == M_E && \result == 0) && __retres1 == 0) && t1_st == 0) && m_pc == t1_pc) && T1_E == M_E) && token <= local) && M_E == 2) && t1_i == 1) && local <= token) && m_pc == 0) && 2 <= E_M) [2020-11-28 03:05:53,007 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((E_1 == M_E && tmp == 0) && T1_E == M_E) && M_E == 2) && !(m_st == 0)) && m_pc == 0) && \result == 0) && __retres1 == 0) && __retres1 == 0) && t1_st == 0) && m_pc == t1_pc) && t1_i == 1) && 2 <= E_M) || (((((((((((((E_1 == M_E && tmp == 0) && T1_E == M_E) && token <= local) && M_E == 2) && m_pc == 0) && \result == 0) && __retres1 == 0) && __retres1 == 0) && t1_st == 0) && m_pc == t1_pc) && t1_i == 1) && local <= token) && 2 <= E_M) [2020-11-28 03:05:53,007 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((\result == 0 && E_1 == M_E) && tmp == 0) && T1_E == M_E) && token <= local) && M_E == 2) && m_pc == 0) && \result == 0) && __retres1 == 0) && __retres1 == 0) && t1_st == 0) && m_pc == t1_pc) && t1_i == 1) && local <= token) && 2 <= E_M) || (((((((((((((\result == 0 && E_1 == M_E) && tmp == 0) && T1_E == M_E) && M_E == 2) && !(m_st == 0)) && m_pc == 0) && \result == 0) && __retres1 == 0) && __retres1 == 0) && t1_st == 0) && m_pc == t1_pc) && t1_i == 1) && 2 <= E_M) [2020-11-28 03:05:53,007 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((\result == 0 && E_1 == M_E) && tmp == 0) && T1_E == M_E) && token <= local) && M_E == 2) && m_pc == 0) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && t1_st == 0) && m_pc == t1_pc) && t1_i == 1) && local <= token) && 2 <= E_M) || ((((((((((((((\result == 0 && E_1 == M_E) && tmp == 0) && T1_E == M_E) && M_E == 2) && !(m_st == 0)) && m_pc == 0) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && t1_st == 0) && m_pc == t1_pc) && t1_i == 1) && 2 <= E_M) [2020-11-28 03:05:53,009 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M) || (((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(t1_st == 0)) && !(m_st == 0)) && !(T1_E == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M)) || (((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && t1_pc == 1) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || ((((((((((!(E_1 == 0) && \result == 0) && tmp == 0) && !(E_1 == 1)) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(t1_st == 0)) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0))) || ((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && !(t1_st == 0)) && !(T1_E == 0)) && local + 1 <= token) && t1_pc == 1) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && token < local + 2) && 2 <= E_M)) || (((((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(T1_E == 0)) && m_pc == 0) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || ((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(T1_E == 0)) && !(m_st == 0)) && t1_pc == 1) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || (((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && !(m_st == 0)) && !(T1_E == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M)) || (((((((((!(E_1 == 0) && \result == 0) && tmp == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0)) && m_pc == 0) [2020-11-28 03:05:53,010 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M) || ((((((((((!(E_1 == 0) && t1_pc == 1) && tmp == 0) && !(E_1 == 1)) && !(T1_E == 1)) && t1_i == 1) && token <= local) && local <= token) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0))) || (((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(t1_st == 0)) && !(m_st == 0)) && !(T1_E == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M)) || ((((((((((local + 1 <= token && !(E_1 == 0)) && t1_pc == 1) && !(E_1 == 1)) && !(T1_E == 1)) && t1_i == 1) && token < local + 2) && !(t1_st == 0)) && m_st == 0) && !(T1_E == 0)) && 2 <= E_M)) || (((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && t1_pc == 1) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || (((((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(T1_E == 0)) && m_pc == 0) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || (((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && !(m_st == 0)) && !(T1_E == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M)) || (((((((((!(E_1 == 0) && \result == 0) && tmp == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0)) && m_pc == 0)) || ((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && !(T1_E == 1)) && t1_i == 1) && !(t1_st == 0)) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0)) [2020-11-28 03:05:53,010 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M) || ((((((((((!(E_1 == 0) && t1_pc == 1) && tmp == 0) && !(E_1 == 1)) && !(T1_E == 1)) && t1_i == 1) && token <= local) && local <= token) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0))) || (((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(t1_st == 0)) && !(m_st == 0)) && !(T1_E == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M)) || ((((((((((local + 1 <= token && !(E_1 == 0)) && t1_pc == 1) && !(E_1 == 1)) && !(T1_E == 1)) && t1_i == 1) && token < local + 2) && !(t1_st == 0)) && m_st == 0) && !(T1_E == 0)) && 2 <= E_M)) || (((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && t1_pc == 1) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || (((((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(T1_E == 0)) && m_pc == 0) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || (((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && !(m_st == 0)) && !(T1_E == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M)) || (((((((((!(E_1 == 0) && \result == 0) && tmp == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0)) && m_pc == 0)) || ((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && !(T1_E == 1)) && t1_i == 1) && !(t1_st == 0)) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0)) [2020-11-28 03:05:53,010 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M) || ((((((((((!(E_1 == 0) && t1_pc == 1) && tmp == 0) && !(E_1 == 1)) && !(T1_E == 1)) && t1_i == 1) && token <= local) && local <= token) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0))) || (((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(t1_st == 0)) && !(m_st == 0)) && !(T1_E == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M)) || ((((((((((local + 1 <= token && !(E_1 == 0)) && t1_pc == 1) && !(E_1 == 1)) && !(T1_E == 1)) && t1_i == 1) && token < local + 2) && !(t1_st == 0)) && m_st == 0) && !(T1_E == 0)) && 2 <= E_M)) || (((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && t1_pc == 1) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || (((((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(T1_E == 0)) && m_pc == 0) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || (((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && !(m_st == 0)) && !(T1_E == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M)) || (((((((((!(E_1 == 0) && \result == 0) && tmp == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0)) && m_pc == 0)) || ((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && !(T1_E == 1)) && t1_i == 1) && !(t1_st == 0)) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0)) [2020-11-28 03:05:53,011 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M) || ((((((((((!(E_1 == 0) && t1_pc == 1) && tmp == 0) && !(E_1 == 1)) && !(T1_E == 1)) && t1_i == 1) && token <= local) && local <= token) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0))) || (((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(t1_st == 0)) && !(m_st == 0)) && !(T1_E == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M)) || ((((((((((local + 1 <= token && !(E_1 == 0)) && t1_pc == 1) && !(E_1 == 1)) && !(T1_E == 1)) && t1_i == 1) && token < local + 2) && !(t1_st == 0)) && m_st == 0) && !(T1_E == 0)) && 2 <= E_M)) || (((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && t1_pc == 1) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || (((((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(T1_E == 0)) && m_pc == 0) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || (((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && !(m_st == 0)) && !(T1_E == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M)) || (((((((((!(E_1 == 0) && \result == 0) && tmp == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0)) && m_pc == 0)) || ((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && !(T1_E == 1)) && t1_i == 1) && !(t1_st == 0)) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0)) [2020-11-28 03:05:53,011 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M) || ((((((((((!(E_1 == 0) && t1_pc == 1) && tmp == 0) && !(E_1 == 1)) && !(T1_E == 1)) && t1_i == 1) && token <= local) && local <= token) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0))) || (((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(t1_st == 0)) && !(m_st == 0)) && !(T1_E == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M)) || ((((((((((local + 1 <= token && !(E_1 == 0)) && t1_pc == 1) && !(E_1 == 1)) && !(T1_E == 1)) && t1_i == 1) && token < local + 2) && !(t1_st == 0)) && m_st == 0) && !(T1_E == 0)) && 2 <= E_M)) || (((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && t1_pc == 1) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || (((((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(T1_E == 0)) && m_pc == 0) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || (((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && !(m_st == 0)) && !(T1_E == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M)) || (((((((((!(E_1 == 0) && \result == 0) && tmp == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0)) && m_pc == 0)) || ((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && !(T1_E == 1)) && t1_i == 1) && !(t1_st == 0)) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0)) [2020-11-28 03:05:53,011 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M) || ((((((((((!(E_1 == 0) && t1_pc == 1) && tmp == 0) && !(E_1 == 1)) && !(T1_E == 1)) && t1_i == 1) && token <= local) && local <= token) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0))) || (((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(t1_st == 0)) && !(m_st == 0)) && !(T1_E == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M)) || ((((((((((local + 1 <= token && !(E_1 == 0)) && t1_pc == 1) && !(E_1 == 1)) && !(T1_E == 1)) && t1_i == 1) && token < local + 2) && !(t1_st == 0)) && m_st == 0) && !(T1_E == 0)) && 2 <= E_M)) || (((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && t1_pc == 1) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || (((((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(T1_E == 0)) && m_pc == 0) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || (((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && !(m_st == 0)) && !(T1_E == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M)) || (((((((((!(E_1 == 0) && \result == 0) && tmp == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0)) && m_pc == 0)) || ((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && !(T1_E == 1)) && t1_i == 1) && !(t1_st == 0)) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0)) [2020-11-28 03:05:53,013 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M) || ((((((((((!(E_1 == 0) && t1_pc == 1) && tmp == 0) && !(E_1 == 1)) && !(T1_E == 1)) && t1_i == 1) && token <= local) && local <= token) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0))) || (((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(t1_st == 0)) && !(m_st == 0)) && !(T1_E == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M)) || ((((((((((local + 1 <= token && !(E_1 == 0)) && t1_pc == 1) && !(E_1 == 1)) && !(T1_E == 1)) && t1_i == 1) && token < local + 2) && !(t1_st == 0)) && m_st == 0) && !(T1_E == 0)) && 2 <= E_M)) || (((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && t1_pc == 1) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || (((((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(T1_E == 0)) && m_pc == 0) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || (((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && !(m_st == 0)) && !(T1_E == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M)) || (((((((((!(E_1 == 0) && \result == 0) && tmp == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0)) && m_pc == 0)) || ((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && !(T1_E == 1)) && t1_i == 1) && !(t1_st == 0)) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0)) [2020-11-28 03:05:53,013 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((!(E_1 == 0) && t1_pc == 1) && !(E_1 == 1)) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && token <= local) && local <= token) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0)) || ((((((((((\result == 0 && !(t1_pc == 1)) && !(E_1 == 0)) && __retres1 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(t1_st == 0)) && !(T1_E == 0)) && 2 <= E_M) && m_pc == 0)) || ((((((((!(E_1 == 0) && !(E_1 == 1)) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(t1_st == 0)) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0))) || ((((((((((\result == 0 && !(t1_pc == 1)) && !(E_1 == 0)) && __retres1 == 0) && !(E_1 == 1)) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(m_st == 0)) && !(T1_E == 0)) && 2 <= E_M)) || (((((((!(E_1 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0)) && m_pc == 0)) || ((((((((((((\result == 0 && !(E_1 == 0)) && !(E_1 == 1)) && token <= local) && !(T1_E == 0)) && m_pc == 0) && !(t1_pc == 1)) && __retres1 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || ((((((((((local + 1 <= token && !(E_1 == 0)) && t1_pc == 1) && !(E_1 == 1)) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && token < local + 2) && !(t1_st == 0)) && !(T1_E == 0)) && 2 <= E_M)) || ((((((((((\result == 0 && !(t1_pc == 1)) && !(E_1 == 0)) && __retres1 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(t1_st == 0)) && !(m_st == 0)) && !(T1_E == 0)) && 2 <= E_M)) || (((((((((((!(E_1 == 0) && t1_pc == 1) && !(E_1 == 1)) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && token <= local) && !(t1_st == 0)) && local <= token) && !(T1_E == 0)) && 2 <= E_M) && m_pc == 0) [2020-11-28 03:05:53,013 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((!(E_1 == 0) && t1_pc == 1) && \result == 0) && !(E_1 == 1)) && __retres1 == 0) && !(T1_E == 1)) && token <= local) && t1_i == 1) && local <= token) && !(T1_E == 0)) && !(m_st == 0)) && 2 <= E_M) || (((((((((((\result == 0 && !(E_1 == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && 2 <= E_M)) || (((((((((((\result == 0 && !(t1_pc == 1)) && !(E_1 == 0)) && \result == 0) && __retres1 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(t1_st == 0)) && !(m_st == 0)) && !(T1_E == 0)) && 2 <= E_M)) || (((((((((((\result == 0 && !(E_1 == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && !(E_1 == 1)) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(m_st == 0)) && !(T1_E == 0)) && 2 <= E_M)) || ((((((((!(E_1 == 0) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0)) && m_pc == 0)) || (((((((((((((\result == 0 && !(E_1 == 0)) && !(E_1 == 1)) && token <= local) && !(T1_E == 0)) && m_pc == 0) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || ((((((((((((!(E_1 == 0) && !(E_1 == 1)) && token <= local) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && t1_pc == 1) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || (((((((((!(E_1 == 0) && \result == 0) && !(E_1 == 1)) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(t1_st == 0)) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0))) || (((((((((((local + 1 <= token && !(E_1 == 0)) && t1_pc == 1) && \result == 0) && !(E_1 == 1)) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && token < local + 2) && !(t1_st == 0)) && !(T1_E == 0)) && 2 <= E_M) [2020-11-28 03:05:53,014 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(t1_st == 0)) && !(m_st == 0)) && !(T1_E == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M) || ((((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && !(T1_E == 0)) && m_pc == 0) && !(m_st == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M)) || (((((((((((!(E_1 == 0) && t1_pc == 1) && !(E_1 == 1)) && !(T1_E == 1)) && t1_i == 1) && token <= local) && !(t1_st == 0)) && local <= token) && !(T1_E == 0)) && 2 <= E_M) && m_pc == 0) && !(m_st == 0))) || ((((((((((local + 1 <= token && !(E_1 == 0)) && t1_pc == 1) && !(E_1 == 1)) && !(T1_E == 1)) && t1_i == 1) && token < local + 2) && !(t1_st == 0)) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0)) [2020-11-28 03:05:53,014 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((!(E_1 == 0) && \result == 0) && tmp == 0) && !(E_1 == 1)) && __retres1 == 0) && !(T1_E == 1)) && token <= local) && t1_i == 1) && local <= token) && !(T1_E == 0)) && 2 <= E_M) && m_pc == 0) || (((((((((local + 1 <= token && !(E_1 == 0)) && t1_pc == 1) && !(E_1 == 1)) && !(T1_E == 1)) && t1_i == 1) && token < local + 2) && m_st == 0) && !(T1_E == 0)) && 2 <= E_M)) || (((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && !(T1_E == 1)) && t1_i == 1) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0))) || (((((((((!(E_1 == 0) && \result == 0) && tmp == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(T1_E == 0)) && 2 <= E_M) && m_pc == 0) && !(m_st == 0)) [2020-11-28 03:05:53,015 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((!(E_1 == 0) && t1_pc == 1) && tmp == 0) && !(E_1 == 1)) && !(T1_E == 1)) && t1_i == 1) && token <= local) && !(t1_st == 0)) && local <= token) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0)) || (((((((((!(E_1 == 0) && \result == 0) && tmp == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0)) && m_pc == 0) [2020-11-28 03:05:53,015 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && \result == 0) && __retres1 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M) || (((((((((((!(E_1 == 0) && \result == 0) && __retres1 == 0) && tmp == 0) && !(E_1 == 1)) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(t1_st == 0)) && !(m_st == 0)) && !(T1_E == 0)) && 2 <= E_M)) || (((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(T1_E == 0)) && m_pc == 0) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || (((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && !(t1_st == 0)) && !(T1_E == 0)) && local + 1 <= token) && t1_pc == 1) && \result == 0) && __retres1 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && token < local + 2) && 2 <= E_M)) || (((((((((((!(t1_pc == 1) && !(E_1 == 0)) && \result == 0) && __retres1 == 0) && tmp == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(t1_st == 0)) && !(m_st == 0)) && !(T1_E == 0)) && 2 <= E_M)) || (((((((((((!(E_1 == 0) && !(t1_pc == 1)) && \result == 0) && tmp == 0) && __retres1 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && 2 <= E_M)) || (((((((((((!(E_1 == 0) && !(t1_pc == 1)) && \result == 0) && tmp == 0) && __retres1 == 0) && !(E_1 == 1)) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(m_st == 0)) && !(T1_E == 0)) && 2 <= E_M)) || ((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(m_st == 0)) && !(T1_E == 0)) && \result == 0) && __retres1 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || (((((((((!(E_1 == 0) && \result == 0) && tmp == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(m_st == 0)) && !(T1_E == 0)) && 2 <= E_M) && m_pc == 0) [2020-11-28 03:05:53,015 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(T1_E == 0)) && m_pc == 0) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M) || ((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && !(m_st == 0)) && !(T1_E == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M)) || ((((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && !(t1_st == 0)) && !(T1_E == 0)) && local + 1 <= token) && t1_pc == 1) && \result == 0) && __retres1 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && token < local + 2) && 2 <= E_M)) || ((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M)) || ((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && !(t1_st == 0)) && !(m_st == 0)) && !(T1_E == 0)) && \result == 0) && __retres1 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M)) || ((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(t1_st == 0)) && !(m_st == 0)) && !(T1_E == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M)) || ((((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && \result == 0) && __retres1 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || (((((((((!(E_1 == 0) && \result == 0) && tmp == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(m_st == 0)) && !(T1_E == 0)) && 2 <= E_M) && m_pc == 0)) || (((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(m_st == 0)) && !(T1_E == 0)) && \result == 0) && __retres1 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M) [2020-11-28 03:05:53,016 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M) || (((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(t1_st == 0)) && !(m_st == 0)) && !(T1_E == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M)) || (((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && t1_pc == 1) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || ((((((((((!(E_1 == 0) && \result == 0) && tmp == 0) && !(E_1 == 1)) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(t1_st == 0)) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0))) || ((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && !(t1_st == 0)) && !(T1_E == 0)) && local + 1 <= token) && t1_pc == 1) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && token < local + 2) && 2 <= E_M)) || (((((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(T1_E == 0)) && m_pc == 0) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || ((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(T1_E == 0)) && !(m_st == 0)) && t1_pc == 1) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || (((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && !(m_st == 0)) && !(T1_E == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M)) || (((((((((!(E_1 == 0) && \result == 0) && tmp == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0)) && m_pc == 0) [2020-11-28 03:05:53,016 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((!(E_1 == 0) && local + 1 <= token) && t1_pc == 1) && !(E_1 == 1)) && !(T1_E == 1)) && t1_i == 1) && token < local + 2) && !(t1_st == 0)) && !(T1_E == 0)) && !(m_st == 0)) || (((((((!(E_1 == 0) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(T1_E == 0)) && !(m_st == 0)) && m_pc == 0)) || ((((((((!(E_1 == 0) && \result == 0) && !(E_1 == 1)) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(t1_st == 0)) && !(T1_E == 0)) && !(m_st == 0)) [2020-11-28 03:05:53,016 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((\result == 0 && !(t1_pc == 1)) && !(E_1 == 0)) && __retres1 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0)) || ((((((((((!(E_1 == 0) && t1_pc == 1) && __retres1 == 0) && !(T1_E == 1)) && token <= local) && t1_i == 1) && !(t1_st == 0)) && local <= token) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0)) [2020-11-28 03:05:53,016 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M) || (((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(t1_st == 0)) && !(m_st == 0)) && !(T1_E == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M)) || (((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && t1_pc == 1) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || ((((((((((!(E_1 == 0) && \result == 0) && tmp == 0) && !(E_1 == 1)) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(t1_st == 0)) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0))) || ((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && !(t1_st == 0)) && !(T1_E == 0)) && local + 1 <= token) && t1_pc == 1) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && token < local + 2) && 2 <= E_M)) || (((((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(T1_E == 0)) && m_pc == 0) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || ((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(T1_E == 0)) && !(m_st == 0)) && t1_pc == 1) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || (((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && !(m_st == 0)) && !(T1_E == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M)) || (((((((((!(E_1 == 0) && \result == 0) && tmp == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0)) && m_pc == 0) [2020-11-28 03:05:53,017 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((!(E_1 == 0) && t1_pc == 1) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && token <= local) && t1_i == 1) && !(t1_st == 0)) && local <= token) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0)) || ((((((((((\result == 0 && !(t1_pc == 1)) && !(E_1 == 0)) && \result == 0) && __retres1 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0)) [2020-11-28 03:05:53,020 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M) || (((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(t1_st == 0)) && !(m_st == 0)) && !(T1_E == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M)) || (((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && t1_pc == 1) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || ((((((((((!(E_1 == 0) && \result == 0) && tmp == 0) && !(E_1 == 1)) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(t1_st == 0)) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0))) || ((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && !(t1_st == 0)) && !(T1_E == 0)) && local + 1 <= token) && t1_pc == 1) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && token < local + 2) && 2 <= E_M)) || (((((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(T1_E == 0)) && m_pc == 0) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || ((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(T1_E == 0)) && !(m_st == 0)) && t1_pc == 1) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || (((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && !(m_st == 0)) && !(T1_E == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M)) || (((((((((!(E_1 == 0) && \result == 0) && tmp == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0)) && m_pc == 0) [2020-11-28 03:05:53,021 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M) || (((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(t1_st == 0)) && !(m_st == 0)) && !(T1_E == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M)) || (((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && t1_pc == 1) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || ((((((((((!(E_1 == 0) && \result == 0) && tmp == 0) && !(E_1 == 1)) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(t1_st == 0)) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0))) || ((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && !(t1_st == 0)) && !(T1_E == 0)) && local + 1 <= token) && t1_pc == 1) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && token < local + 2) && 2 <= E_M)) || (((((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(T1_E == 0)) && m_pc == 0) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || ((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(T1_E == 0)) && !(m_st == 0)) && t1_pc == 1) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || (((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && !(m_st == 0)) && !(T1_E == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M)) || (((((((((!(E_1 == 0) && \result == 0) && tmp == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0)) && m_pc == 0) [2020-11-28 03:05:53,021 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((!(E_1 == 0) && __retres1 == 0) && tmp == 0) && !(E_1 == 1)) && !(T1_E == 1)) && t1_i == 1) && !(t1_st == 0)) && !(T1_E == 0)) && !(m_st == 0)) || ((((((((((local + 1 <= token && !(E_1 == 0)) && t1_pc == 1) && __retres1 == 0) && !(E_1 == 1)) && !(T1_E == 1)) && t1_i == 1) && token < local + 2) && !(t1_st == 0)) && m_st == 0) && !(T1_E == 0))) || ((((((((!(E_1 == 0) && \result == 0) && tmp == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(T1_E == 0)) && !(m_st == 0)) && m_pc == 0) [2020-11-28 03:05:53,023 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((\result == 0 && !(E_1 == 0)) && __retres1 == 0) && tmp == 0) && !(E_1 == 1)) && !(T1_E == 1)) && t1_i == 1) && !(t1_st == 0)) && !(T1_E == 0)) && !(m_st == 0)) || (((((((((((\result == 0 && !(E_1 == 0)) && local + 1 <= token) && t1_pc == 1) && __retres1 == 0) && !(E_1 == 1)) && !(T1_E == 1)) && t1_i == 1) && token < local + 2) && !(t1_st == 0)) && m_st == 0) && !(T1_E == 0))) || ((((((((!(E_1 == 0) && \result == 0) && tmp == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(T1_E == 0)) && !(m_st == 0)) && m_pc == 0) [2020-11-28 03:05:53,024 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((!(t1_pc == 1) && !(E_1 == 0)) && \result == 0) && tmp == 0) && __retres1 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0)) || (((((((((((!(E_1 == 0) && \result == 0) && tmp == 0) && __retres1 == 0) && !(E_1 == 1)) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(t1_st == 0)) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0))) || ((((((((((((!(E_1 == 0) && tmp == 0) && token <= local) && !(t1_st == 0)) && !(T1_E == 0)) && !(m_st == 0)) && t1_pc == 1) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M) [2020-11-28 03:05:53,024 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M) || (((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(t1_st == 0)) && !(m_st == 0)) && !(T1_E == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M)) || (((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && t1_pc == 1) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || ((((((((((!(E_1 == 0) && \result == 0) && tmp == 0) && !(E_1 == 1)) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(t1_st == 0)) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0))) || ((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && !(t1_st == 0)) && !(T1_E == 0)) && local + 1 <= token) && t1_pc == 1) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && token < local + 2) && 2 <= E_M)) || (((((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(T1_E == 0)) && m_pc == 0) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || ((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(T1_E == 0)) && !(m_st == 0)) && t1_pc == 1) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || (((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && !(m_st == 0)) && !(T1_E == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M)) || (((((((((!(E_1 == 0) && \result == 0) && tmp == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0)) && m_pc == 0) [2020-11-28 03:05:53,024 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((\result == 0 && !(t1_pc == 1)) && !(E_1 == 0)) && \result == 0) && __retres1 == 0) && tmp == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0)) || ((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && !(t1_st == 0)) && !(m_st == 0)) && !(T1_E == 0)) && \result == 0) && __retres1 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M)) || ((((((((((((!(E_1 == 0) && tmp == 0) && token <= local) && !(t1_st == 0)) && !(T1_E == 0)) && !(m_st == 0)) && t1_pc == 1) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M) [2020-11-28 03:05:53,024 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M) || (((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(t1_st == 0)) && !(m_st == 0)) && !(T1_E == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M)) || (((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && t1_pc == 1) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || ((((((((((!(E_1 == 0) && \result == 0) && tmp == 0) && !(E_1 == 1)) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(t1_st == 0)) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0))) || ((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && !(t1_st == 0)) && !(T1_E == 0)) && local + 1 <= token) && t1_pc == 1) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && token < local + 2) && 2 <= E_M)) || (((((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(T1_E == 0)) && m_pc == 0) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || ((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(T1_E == 0)) && !(m_st == 0)) && t1_pc == 1) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || (((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && !(m_st == 0)) && !(T1_E == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M)) || (((((((((!(E_1 == 0) && \result == 0) && tmp == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0)) && m_pc == 0) [2020-11-28 03:05:53,025 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((local + 1 <= token && !(E_1 == 0)) && t1_pc == 1) && !(E_1 == 1)) && !(T1_E == 1)) && t1_i == 1) && token < local + 2) && m_st == 0) && !(T1_E == 0)) || ((((((((!(E_1 == 0) && \result == 0) && tmp == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(T1_E == 0)) && m_pc == 0) && !(m_st == 0))) || ((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && !(T1_E == 1)) && t1_i == 1) && !(T1_E == 0)) && !(m_st == 0)) [2020-11-28 03:05:53,025 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((!(E_1 == 0) && t1_pc == 1) && \result == 0) && tmp == 0) && __retres1 == 0) && !(T1_E == 1)) && token <= local) && t1_i == 1) && local <= token) && !(T1_E == 0)) && !(m_st == 0)) && 2 <= E_M) || (((((((((!(E_1 == 0) && \result == 0) && tmp == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(t1_st == 0)) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0))) || ((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(T1_E == 0)) && !(m_st == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M) [2020-11-28 03:05:53,026 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M) || (((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(t1_st == 0)) && !(m_st == 0)) && !(T1_E == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M)) || (((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && t1_pc == 1) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || ((((((((((!(E_1 == 0) && \result == 0) && tmp == 0) && !(E_1 == 1)) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(t1_st == 0)) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0))) || ((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && !(t1_st == 0)) && !(T1_E == 0)) && local + 1 <= token) && t1_pc == 1) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && token < local + 2) && 2 <= E_M)) || (((((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(T1_E == 0)) && m_pc == 0) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || ((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(T1_E == 0)) && !(m_st == 0)) && t1_pc == 1) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || (((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && !(m_st == 0)) && !(T1_E == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M)) || (((((((((!(E_1 == 0) && \result == 0) && tmp == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0)) && m_pc == 0) [2020-11-28 03:05:53,026 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((!(E_1 == 0) && t1_pc == 1) && !(E_1 == 1)) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && token <= local) && local <= token) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0)) || ((((((((!(E_1 == 0) && !(E_1 == 1)) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(t1_st == 0)) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0))) || ((((((((((\result == 0 && !(t1_pc == 1)) && !(E_1 == 0)) && __retres1 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(t1_st == 0)) && !(T1_E == 0)) && 2 <= E_M) && m_pc == 0)) || ((((((((((\result == 0 && !(t1_pc == 1)) && !(E_1 == 0)) && __retres1 == 0) && !(E_1 == 1)) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(m_st == 0)) && !(T1_E == 0)) && 2 <= E_M)) || (((((((!(E_1 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0)) && m_pc == 0)) || ((((((((((((\result == 0 && !(E_1 == 0)) && !(E_1 == 1)) && token <= local) && !(T1_E == 0)) && m_pc == 0) && !(t1_pc == 1)) && __retres1 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || ((((((((((local + 1 <= token && !(E_1 == 0)) && t1_pc == 1) && !(E_1 == 1)) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && token < local + 2) && !(t1_st == 0)) && !(T1_E == 0)) && 2 <= E_M)) || ((((((((((\result == 0 && !(t1_pc == 1)) && !(E_1 == 0)) && __retres1 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(t1_st == 0)) && !(m_st == 0)) && !(T1_E == 0)) && 2 <= E_M)) || (((((((((((!(E_1 == 0) && t1_pc == 1) && !(E_1 == 1)) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && token <= local) && !(t1_st == 0)) && local <= token) && !(T1_E == 0)) && 2 <= E_M) && m_pc == 0) [2020-11-28 03:05:53,026 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M) || (((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(t1_st == 0)) && !(m_st == 0)) && !(T1_E == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M)) || (((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && t1_pc == 1) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || ((((((((((!(E_1 == 0) && \result == 0) && tmp == 0) && !(E_1 == 1)) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(t1_st == 0)) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0))) || ((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && !(t1_st == 0)) && !(T1_E == 0)) && local + 1 <= token) && t1_pc == 1) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && token < local + 2) && 2 <= E_M)) || (((((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(T1_E == 0)) && m_pc == 0) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || ((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(T1_E == 0)) && !(m_st == 0)) && t1_pc == 1) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || (((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && !(m_st == 0)) && !(T1_E == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M)) || (((((((((!(E_1 == 0) && \result == 0) && tmp == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0)) && m_pc == 0) [2020-11-28 03:05:53,026 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((!(E_1 == 0) && t1_pc == 1) && \result == 0) && !(E_1 == 1)) && __retres1 == 0) && !(T1_E == 1)) && token <= local) && t1_i == 1) && local <= token) && !(T1_E == 0)) && !(m_st == 0)) && 2 <= E_M) || (((((((((((\result == 0 && !(E_1 == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && 2 <= E_M)) || (((((((((((\result == 0 && !(t1_pc == 1)) && !(E_1 == 0)) && \result == 0) && __retres1 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(t1_st == 0)) && !(m_st == 0)) && !(T1_E == 0)) && 2 <= E_M)) || (((((((((((\result == 0 && !(E_1 == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && !(E_1 == 1)) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(m_st == 0)) && !(T1_E == 0)) && 2 <= E_M)) || ((((((((!(E_1 == 0) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0)) && m_pc == 0)) || (((((((((((((\result == 0 && !(E_1 == 0)) && !(E_1 == 1)) && token <= local) && !(T1_E == 0)) && m_pc == 0) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || ((((((((((((!(E_1 == 0) && !(E_1 == 1)) && token <= local) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && t1_pc == 1) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || (((((((((!(E_1 == 0) && \result == 0) && !(E_1 == 1)) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(t1_st == 0)) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0))) || (((((((((((local + 1 <= token && !(E_1 == 0)) && t1_pc == 1) && \result == 0) && !(E_1 == 1)) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && token < local + 2) && !(t1_st == 0)) && !(T1_E == 0)) && 2 <= E_M) [2020-11-28 03:05:53,026 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M) || (((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(t1_st == 0)) && !(m_st == 0)) && !(T1_E == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M)) || (((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && t1_pc == 1) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || ((((((((((!(E_1 == 0) && \result == 0) && tmp == 0) && !(E_1 == 1)) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(t1_st == 0)) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0))) || ((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && !(t1_st == 0)) && !(T1_E == 0)) && local + 1 <= token) && t1_pc == 1) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && token < local + 2) && 2 <= E_M)) || (((((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(T1_E == 0)) && m_pc == 0) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || ((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(T1_E == 0)) && !(m_st == 0)) && t1_pc == 1) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || (((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && !(m_st == 0)) && !(T1_E == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M)) || (((((((((!(E_1 == 0) && \result == 0) && tmp == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0)) && m_pc == 0) [2020-11-28 03:05:53,027 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M) || (((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(t1_st == 0)) && !(m_st == 0)) && !(T1_E == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M)) || (((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && t1_pc == 1) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || ((((((((((!(E_1 == 0) && \result == 0) && tmp == 0) && !(E_1 == 1)) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(t1_st == 0)) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0))) || ((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && !(t1_st == 0)) && !(T1_E == 0)) && local + 1 <= token) && t1_pc == 1) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && token < local + 2) && 2 <= E_M)) || (((((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(T1_E == 0)) && m_pc == 0) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || ((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(T1_E == 0)) && !(m_st == 0)) && t1_pc == 1) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || (((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && !(m_st == 0)) && !(T1_E == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M)) || (((((((((!(E_1 == 0) && \result == 0) && tmp == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0)) && m_pc == 0) [2020-11-28 03:05:53,027 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((!(E_1 == 0) && \result == 0) && __retres1 == 0) && tmp == 0) && !(E_1 == 1)) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(t1_st == 0)) && !(m_st == 0)) && !(T1_E == 0)) && 2 <= E_M) || (((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && \result == 0) && __retres1 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || (((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(T1_E == 0)) && m_pc == 0) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || (((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && !(t1_st == 0)) && !(T1_E == 0)) && local + 1 <= token) && t1_pc == 1) && \result == 0) && __retres1 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && token < local + 2) && 2 <= E_M)) || (((((((((((!(t1_pc == 1) && !(E_1 == 0)) && \result == 0) && __retres1 == 0) && tmp == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(t1_st == 0)) && !(m_st == 0)) && !(T1_E == 0)) && 2 <= E_M)) || (((((((((((!(E_1 == 0) && !(t1_pc == 1)) && \result == 0) && tmp == 0) && __retres1 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && 2 <= E_M)) || (((((((((((!(E_1 == 0) && !(t1_pc == 1)) && \result == 0) && tmp == 0) && __retres1 == 0) && !(E_1 == 1)) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(m_st == 0)) && !(T1_E == 0)) && 2 <= E_M)) || ((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(m_st == 0)) && !(T1_E == 0)) && \result == 0) && __retres1 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || (((((((((!(E_1 == 0) && \result == 0) && tmp == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(m_st == 0)) && !(T1_E == 0)) && 2 <= E_M) && m_pc == 0) [2020-11-28 03:05:53,027 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(T1_E == 0)) && m_pc == 0) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M) || ((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M)) || ((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && !(m_st == 0)) && !(T1_E == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M)) || ((((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && !(t1_st == 0)) && !(T1_E == 0)) && local + 1 <= token) && t1_pc == 1) && \result == 0) && __retres1 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && token < local + 2) && 2 <= E_M)) || ((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && !(t1_st == 0)) && !(m_st == 0)) && !(T1_E == 0)) && \result == 0) && __retres1 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M)) || ((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(t1_st == 0)) && !(m_st == 0)) && !(T1_E == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M)) || ((((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && \result == 0) && __retres1 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || (((((((((!(E_1 == 0) && \result == 0) && tmp == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(m_st == 0)) && !(T1_E == 0)) && 2 <= E_M) && m_pc == 0)) || (((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(m_st == 0)) && !(T1_E == 0)) && \result == 0) && __retres1 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M) [2020-11-28 03:05:53,030 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M) || (((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(t1_st == 0)) && !(m_st == 0)) && !(T1_E == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M)) || (((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && t1_pc == 1) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || ((((((((((!(E_1 == 0) && \result == 0) && tmp == 0) && !(E_1 == 1)) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(t1_st == 0)) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0))) || ((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && !(t1_st == 0)) && !(T1_E == 0)) && local + 1 <= token) && t1_pc == 1) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && token < local + 2) && 2 <= E_M)) || (((((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(T1_E == 0)) && m_pc == 0) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || ((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(T1_E == 0)) && !(m_st == 0)) && t1_pc == 1) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || (((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && !(m_st == 0)) && !(T1_E == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M)) || (((((((((!(E_1 == 0) && \result == 0) && tmp == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0)) && m_pc == 0) [2020-11-28 03:05:53,108 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_9e8d23e1-c20e-44c6-8fc2-3dd2dd4e6337/bin/uautomizer/witness.graphml [2020-11-28 03:05:53,108 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-28 03:05:53,109 INFO L168 Benchmark]: Toolchain (without parser) took 26703.17 ms. Allocated memory was 100.7 MB in the beginning and 364.9 MB in the end (delta: 264.2 MB). Free memory was 64.0 MB in the beginning and 318.6 MB in the end (delta: -254.6 MB). Peak memory consumption was 8.0 MB. Max. memory is 16.1 GB. [2020-11-28 03:05:53,110 INFO L168 Benchmark]: CDTParser took 0.33 ms. Allocated memory is still 100.7 MB. Free memory is still 80.3 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-11-28 03:05:53,110 INFO L168 Benchmark]: CACSL2BoogieTranslator took 416.26 ms. Allocated memory is still 100.7 MB. Free memory was 63.8 MB in the beginning and 73.7 MB in the end (delta: -9.9 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2020-11-28 03:05:53,110 INFO L168 Benchmark]: Boogie Procedure Inliner took 56.36 ms. Allocated memory is still 100.7 MB. Free memory was 73.7 MB in the beginning and 71.3 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-28 03:05:53,111 INFO L168 Benchmark]: Boogie Preprocessor took 38.24 ms. Allocated memory is still 100.7 MB. Free memory was 71.0 MB in the beginning and 69.2 MB in the end (delta: 1.8 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-28 03:05:53,111 INFO L168 Benchmark]: RCFGBuilder took 924.48 ms. Allocated memory was 100.7 MB in the beginning and 123.7 MB in the end (delta: 23.1 MB). Free memory was 69.2 MB in the beginning and 93.5 MB in the end (delta: -24.3 MB). Peak memory consumption was 40.0 MB. Max. memory is 16.1 GB. [2020-11-28 03:05:53,112 INFO L168 Benchmark]: TraceAbstraction took 25075.48 ms. Allocated memory was 123.7 MB in the beginning and 364.9 MB in the end (delta: 241.2 MB). Free memory was 93.5 MB in the beginning and 329.1 MB in the end (delta: -235.6 MB). Peak memory consumption was 216.0 MB. Max. memory is 16.1 GB. [2020-11-28 03:05:53,112 INFO L168 Benchmark]: Witness Printer took 171.64 ms. Allocated memory is still 364.9 MB. Free memory was 328.0 MB in the beginning and 318.6 MB in the end (delta: 9.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2020-11-28 03:05:53,116 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.33 ms. Allocated memory is still 100.7 MB. Free memory is still 80.3 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 416.26 ms. Allocated memory is still 100.7 MB. Free memory was 63.8 MB in the beginning and 73.7 MB in the end (delta: -9.9 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 56.36 ms. Allocated memory is still 100.7 MB. Free memory was 73.7 MB in the beginning and 71.3 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 38.24 ms. Allocated memory is still 100.7 MB. Free memory was 71.0 MB in the beginning and 69.2 MB in the end (delta: 1.8 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 924.48 ms. Allocated memory was 100.7 MB in the beginning and 123.7 MB in the end (delta: 23.1 MB). Free memory was 69.2 MB in the beginning and 93.5 MB in the end (delta: -24.3 MB). Peak memory consumption was 40.0 MB. Max. memory is 16.1 GB. * TraceAbstraction took 25075.48 ms. Allocated memory was 123.7 MB in the beginning and 364.9 MB in the end (delta: 241.2 MB). Free memory was 93.5 MB in the beginning and 329.1 MB in the end (delta: -235.6 MB). Peak memory consumption was 216.0 MB. Max. memory is 16.1 GB. * Witness Printer took 171.64 ms. Allocated memory is still 364.9 MB. Free memory was 328.0 MB in the beginning and 318.6 MB in the end (delta: 9.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 3]: 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: 134]: Loop Invariant Derived loop invariant: ((((((((((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && \result == 0) && __retres1 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M) || (((((((((((!(E_1 == 0) && \result == 0) && __retres1 == 0) && tmp == 0) && !(E_1 == 1)) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(t1_st == 0)) && !(m_st == 0)) && !(T1_E == 0)) && 2 <= E_M)) || (((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(T1_E == 0)) && m_pc == 0) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || (((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && !(t1_st == 0)) && !(T1_E == 0)) && local + 1 <= token) && t1_pc == 1) && \result == 0) && __retres1 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && token < local + 2) && 2 <= E_M)) || (((((((((((!(t1_pc == 1) && !(E_1 == 0)) && \result == 0) && __retres1 == 0) && tmp == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(t1_st == 0)) && !(m_st == 0)) && !(T1_E == 0)) && 2 <= E_M)) || (((((((((((!(E_1 == 0) && !(t1_pc == 1)) && \result == 0) && tmp == 0) && __retres1 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && 2 <= E_M)) || (((((((((((!(E_1 == 0) && !(t1_pc == 1)) && \result == 0) && tmp == 0) && __retres1 == 0) && !(E_1 == 1)) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(m_st == 0)) && !(T1_E == 0)) && 2 <= E_M)) || ((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(m_st == 0)) && !(T1_E == 0)) && \result == 0) && __retres1 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || (((((((((!(E_1 == 0) && \result == 0) && tmp == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(m_st == 0)) && !(T1_E == 0)) && 2 <= E_M) && m_pc == 0) - InvariantResult [Line: 79]: Loop Invariant Derived loop invariant: (((((((((((((!(E_1 == 0) && \result == 0) && tmp == 0) && !(E_1 == 1)) && __retres1 == 0) && !(T1_E == 1)) && token <= local) && t1_i == 1) && local <= token) && !(T1_E == 0)) && 2 <= E_M) && m_pc == 0) || (((((((((local + 1 <= token && !(E_1 == 0)) && t1_pc == 1) && !(E_1 == 1)) && !(T1_E == 1)) && t1_i == 1) && token < local + 2) && m_st == 0) && !(T1_E == 0)) && 2 <= E_M)) || (((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && !(T1_E == 1)) && t1_i == 1) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0))) || (((((((((!(E_1 == 0) && \result == 0) && tmp == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(T1_E == 0)) && 2 <= E_M) && m_pc == 0) && !(m_st == 0)) - InvariantResult [Line: 134]: Loop Invariant Derived loop invariant: (((((((((!(E_1 == 0) && __retres1 == 0) && tmp == 0) && !(E_1 == 1)) && !(T1_E == 1)) && t1_i == 1) && !(t1_st == 0)) && !(T1_E == 0)) && !(m_st == 0)) || ((((((((((local + 1 <= token && !(E_1 == 0)) && t1_pc == 1) && __retres1 == 0) && !(E_1 == 1)) && !(T1_E == 1)) && t1_i == 1) && token < local + 2) && !(t1_st == 0)) && m_st == 0) && !(T1_E == 0))) || ((((((((!(E_1 == 0) && \result == 0) && tmp == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(T1_E == 0)) && !(m_st == 0)) && m_pc == 0) - InvariantResult [Line: 275]: Loop Invariant Derived loop invariant: ((((((((((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M) || (((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(t1_st == 0)) && !(m_st == 0)) && !(T1_E == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M)) || (((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && t1_pc == 1) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || ((((((((((!(E_1 == 0) && \result == 0) && tmp == 0) && !(E_1 == 1)) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(t1_st == 0)) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0))) || ((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && !(t1_st == 0)) && !(T1_E == 0)) && local + 1 <= token) && t1_pc == 1) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && token < local + 2) && 2 <= E_M)) || (((((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(T1_E == 0)) && m_pc == 0) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || ((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(T1_E == 0)) && !(m_st == 0)) && t1_pc == 1) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || (((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && !(m_st == 0)) && !(T1_E == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M)) || (((((((((!(E_1 == 0) && \result == 0) && tmp == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0)) && m_pc == 0) - InvariantResult [Line: 196]: Loop Invariant Derived loop invariant: ((((((((((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M) || ((((((((((!(E_1 == 0) && t1_pc == 1) && tmp == 0) && !(E_1 == 1)) && !(T1_E == 1)) && t1_i == 1) && token <= local) && local <= token) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0))) || (((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(t1_st == 0)) && !(m_st == 0)) && !(T1_E == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M)) || ((((((((((local + 1 <= token && !(E_1 == 0)) && t1_pc == 1) && !(E_1 == 1)) && !(T1_E == 1)) && t1_i == 1) && token < local + 2) && !(t1_st == 0)) && m_st == 0) && !(T1_E == 0)) && 2 <= E_M)) || (((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && t1_pc == 1) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || (((((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(T1_E == 0)) && m_pc == 0) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || (((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && !(m_st == 0)) && !(T1_E == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M)) || (((((((((!(E_1 == 0) && \result == 0) && tmp == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0)) && m_pc == 0)) || ((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && !(T1_E == 1)) && t1_i == 1) && !(t1_st == 0)) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0)) - InvariantResult [Line: 134]: Loop Invariant Derived loop invariant: (((((((((((!(t1_pc == 1) && !(E_1 == 0)) && \result == 0) && tmp == 0) && __retres1 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0)) || (((((((((((!(E_1 == 0) && \result == 0) && tmp == 0) && __retres1 == 0) && !(E_1 == 1)) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(t1_st == 0)) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0))) || ((((((((((((!(E_1 == 0) && tmp == 0) && token <= local) && !(t1_st == 0)) && !(T1_E == 0)) && !(m_st == 0)) && t1_pc == 1) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M) - InvariantResult [Line: 112]: Loop Invariant Derived loop invariant: ((((((((((((((((((!(E_1 == 0) && t1_pc == 1) && \result == 0) && !(E_1 == 1)) && __retres1 == 0) && !(T1_E == 1)) && token <= local) && t1_i == 1) && local <= token) && !(T1_E == 0)) && !(m_st == 0)) && 2 <= E_M) || (((((((((((\result == 0 && !(E_1 == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && 2 <= E_M)) || (((((((((((\result == 0 && !(t1_pc == 1)) && !(E_1 == 0)) && \result == 0) && __retres1 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(t1_st == 0)) && !(m_st == 0)) && !(T1_E == 0)) && 2 <= E_M)) || (((((((((((\result == 0 && !(E_1 == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && !(E_1 == 1)) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(m_st == 0)) && !(T1_E == 0)) && 2 <= E_M)) || ((((((((!(E_1 == 0) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0)) && m_pc == 0)) || (((((((((((((\result == 0 && !(E_1 == 0)) && !(E_1 == 1)) && token <= local) && !(T1_E == 0)) && m_pc == 0) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || ((((((((((((!(E_1 == 0) && !(E_1 == 1)) && token <= local) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && t1_pc == 1) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || (((((((((!(E_1 == 0) && \result == 0) && !(E_1 == 1)) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(t1_st == 0)) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0))) || (((((((((((local + 1 <= token && !(E_1 == 0)) && t1_pc == 1) && \result == 0) && !(E_1 == 1)) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && token < local + 2) && !(t1_st == 0)) && !(T1_E == 0)) && 2 <= E_M) - InvariantResult [Line: 134]: Loop Invariant Derived loop invariant: ((((((((((((E_1 == M_E && tmp == 0) && T1_E == M_E) && M_E == 2) && !(m_st == 0)) && m_pc == 0) && \result == 0) && __retres1 == 0) && __retres1 == 0) && t1_st == 0) && m_pc == t1_pc) && t1_i == 1) && 2 <= E_M) || (((((((((((((E_1 == M_E && tmp == 0) && T1_E == M_E) && token <= local) && M_E == 2) && m_pc == 0) && \result == 0) && __retres1 == 0) && __retres1 == 0) && t1_st == 0) && m_pc == t1_pc) && t1_i == 1) && local <= token) && 2 <= E_M) - InvariantResult [Line: 112]: Loop Invariant Derived loop invariant: ((((((((((((((((((!(E_1 == 0) && t1_pc == 1) && \result == 0) && !(E_1 == 1)) && __retres1 == 0) && !(T1_E == 1)) && token <= local) && t1_i == 1) && local <= token) && !(T1_E == 0)) && !(m_st == 0)) && 2 <= E_M) || (((((((((((\result == 0 && !(E_1 == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && 2 <= E_M)) || (((((((((((\result == 0 && !(t1_pc == 1)) && !(E_1 == 0)) && \result == 0) && __retres1 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(t1_st == 0)) && !(m_st == 0)) && !(T1_E == 0)) && 2 <= E_M)) || (((((((((((\result == 0 && !(E_1 == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && !(E_1 == 1)) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(m_st == 0)) && !(T1_E == 0)) && 2 <= E_M)) || ((((((((!(E_1 == 0) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0)) && m_pc == 0)) || (((((((((((((\result == 0 && !(E_1 == 0)) && !(E_1 == 1)) && token <= local) && !(T1_E == 0)) && m_pc == 0) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || ((((((((((((!(E_1 == 0) && !(E_1 == 1)) && token <= local) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && t1_pc == 1) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || (((((((((!(E_1 == 0) && \result == 0) && !(E_1 == 1)) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(t1_st == 0)) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0))) || (((((((((((local + 1 <= token && !(E_1 == 0)) && t1_pc == 1) && \result == 0) && !(E_1 == 1)) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && token < local + 2) && !(t1_st == 0)) && !(T1_E == 0)) && 2 <= E_M) - InvariantResult [Line: 35]: Loop Invariant Derived loop invariant: (((((((((local + 1 <= token && !(E_1 == 0)) && t1_pc == 1) && !(E_1 == 1)) && !(T1_E == 1)) && t1_i == 1) && token < local + 2) && !(t1_st == 0)) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0) - InvariantResult [Line: 112]: Loop Invariant Derived loop invariant: ((((((((((!(E_1 == 0) && local + 1 <= token) && t1_pc == 1) && !(E_1 == 1)) && !(T1_E == 1)) && t1_i == 1) && token < local + 2) && !(t1_st == 0)) && !(T1_E == 0)) && !(m_st == 0)) || (((((((!(E_1 == 0) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(T1_E == 0)) && !(m_st == 0)) && m_pc == 0)) || ((((((((!(E_1 == 0) && \result == 0) && !(E_1 == 1)) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(t1_st == 0)) && !(T1_E == 0)) && !(m_st == 0)) - InvariantResult [Line: 376]: Loop Invariant Derived loop invariant: (((((((((E_1 == M_E && t1_st == 0) && m_pc == t1_pc) && T1_E == M_E) && token <= local) && M_E == 2) && t1_i == 1) && m_st == 0) && local <= token) && m_pc == 0) && 2 <= E_M - InvariantResult [Line: 202]: Loop Invariant Derived loop invariant: ((((((((((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M) || ((((((((((!(E_1 == 0) && t1_pc == 1) && tmp == 0) && !(E_1 == 1)) && !(T1_E == 1)) && t1_i == 1) && token <= local) && local <= token) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0))) || (((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(t1_st == 0)) && !(m_st == 0)) && !(T1_E == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M)) || ((((((((((local + 1 <= token && !(E_1 == 0)) && t1_pc == 1) && !(E_1 == 1)) && !(T1_E == 1)) && t1_i == 1) && token < local + 2) && !(t1_st == 0)) && m_st == 0) && !(T1_E == 0)) && 2 <= E_M)) || (((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && t1_pc == 1) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || (((((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(T1_E == 0)) && m_pc == 0) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || (((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && !(m_st == 0)) && !(T1_E == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M)) || (((((((((!(E_1 == 0) && \result == 0) && tmp == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0)) && m_pc == 0)) || ((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && !(T1_E == 1)) && t1_i == 1) && !(t1_st == 0)) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0)) - InvariantResult [Line: 79]: Loop Invariant Derived loop invariant: (((((((((((!(E_1 == 0) && t1_pc == 1) && tmp == 0) && !(E_1 == 1)) && !(T1_E == 1)) && t1_i == 1) && token <= local) && !(t1_st == 0)) && local <= token) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0)) || (((((((((!(E_1 == 0) && \result == 0) && tmp == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0)) && m_pc == 0) - InvariantResult [Line: 115]: Loop Invariant Derived loop invariant: (((((((((E_1 == M_E && __retres1 == 0) && t1_st == 0) && m_pc == t1_pc) && T1_E == M_E) && M_E == 2) && t1_i == 1) && !(m_st == 0)) && m_pc == 0) && 2 <= E_M) || ((((((((((E_1 == M_E && __retres1 == 0) && t1_st == 0) && m_pc == t1_pc) && T1_E == M_E) && token <= local) && M_E == 2) && t1_i == 1) && local <= token) && m_pc == 0) && 2 <= E_M) - InvariantResult [Line: 279]: Loop Invariant Derived loop invariant: ((((((((((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M) || (((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(t1_st == 0)) && !(m_st == 0)) && !(T1_E == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M)) || (((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && t1_pc == 1) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || ((((((((((!(E_1 == 0) && \result == 0) && tmp == 0) && !(E_1 == 1)) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(t1_st == 0)) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0))) || ((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && !(t1_st == 0)) && !(T1_E == 0)) && local + 1 <= token) && t1_pc == 1) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && token < local + 2) && 2 <= E_M)) || (((((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(T1_E == 0)) && m_pc == 0) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || ((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(T1_E == 0)) && !(m_st == 0)) && t1_pc == 1) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || (((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && !(m_st == 0)) && !(T1_E == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M)) || (((((((((!(E_1 == 0) && \result == 0) && tmp == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0)) && m_pc == 0) - InvariantResult [Line: 176]: Loop Invariant Derived loop invariant: ((((((((((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M) || (((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(t1_st == 0)) && !(m_st == 0)) && !(T1_E == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M)) || (((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && t1_pc == 1) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || ((((((((((!(E_1 == 0) && \result == 0) && tmp == 0) && !(E_1 == 1)) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(t1_st == 0)) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0))) || ((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && !(t1_st == 0)) && !(T1_E == 0)) && local + 1 <= token) && t1_pc == 1) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && token < local + 2) && 2 <= E_M)) || (((((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(T1_E == 0)) && m_pc == 0) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || ((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(T1_E == 0)) && !(m_st == 0)) && t1_pc == 1) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || (((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && !(m_st == 0)) && !(T1_E == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M)) || (((((((((!(E_1 == 0) && \result == 0) && tmp == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0)) && m_pc == 0) - InvariantResult [Line: 176]: Loop Invariant Derived loop invariant: ((((((((((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M) || (((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(t1_st == 0)) && !(m_st == 0)) && !(T1_E == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M)) || (((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && t1_pc == 1) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || ((((((((((!(E_1 == 0) && \result == 0) && tmp == 0) && !(E_1 == 1)) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(t1_st == 0)) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0))) || ((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && !(t1_st == 0)) && !(T1_E == 0)) && local + 1 <= token) && t1_pc == 1) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && token < local + 2) && 2 <= E_M)) || (((((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(T1_E == 0)) && m_pc == 0) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || ((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(T1_E == 0)) && !(m_st == 0)) && t1_pc == 1) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || (((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && !(m_st == 0)) && !(T1_E == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M)) || (((((((((!(E_1 == 0) && \result == 0) && tmp == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0)) && m_pc == 0) - InvariantResult [Line: 176]: Loop Invariant Derived loop invariant: ((((((((((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M) || ((((((((((!(E_1 == 0) && t1_pc == 1) && tmp == 0) && !(E_1 == 1)) && !(T1_E == 1)) && t1_i == 1) && token <= local) && local <= token) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0))) || (((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(t1_st == 0)) && !(m_st == 0)) && !(T1_E == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M)) || ((((((((((local + 1 <= token && !(E_1 == 0)) && t1_pc == 1) && !(E_1 == 1)) && !(T1_E == 1)) && t1_i == 1) && token < local + 2) && !(t1_st == 0)) && m_st == 0) && !(T1_E == 0)) && 2 <= E_M)) || (((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && t1_pc == 1) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || (((((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(T1_E == 0)) && m_pc == 0) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || (((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && !(m_st == 0)) && !(T1_E == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M)) || (((((((((!(E_1 == 0) && \result == 0) && tmp == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0)) && m_pc == 0)) || ((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && !(T1_E == 1)) && t1_i == 1) && !(t1_st == 0)) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0)) - InvariantResult [Line: 386]: Loop Invariant Derived loop invariant: ((((((((((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M) || (((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(t1_st == 0)) && !(m_st == 0)) && !(T1_E == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M)) || (((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && t1_pc == 1) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || ((((((((((!(E_1 == 0) && \result == 0) && tmp == 0) && !(E_1 == 1)) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(t1_st == 0)) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0))) || ((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && !(t1_st == 0)) && !(T1_E == 0)) && local + 1 <= token) && t1_pc == 1) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && token < local + 2) && 2 <= E_M)) || (((((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(T1_E == 0)) && m_pc == 0) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || ((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(T1_E == 0)) && !(m_st == 0)) && t1_pc == 1) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || (((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && !(m_st == 0)) && !(T1_E == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M)) || (((((((((!(E_1 == 0) && \result == 0) && tmp == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0)) && m_pc == 0) - InvariantResult [Line: 352]: Loop Invariant Derived loop invariant: ((((((((((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M) || (((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(t1_st == 0)) && !(m_st == 0)) && !(T1_E == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M)) || (((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && t1_pc == 1) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || ((((((((((!(E_1 == 0) && \result == 0) && tmp == 0) && !(E_1 == 1)) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(t1_st == 0)) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0))) || ((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && !(t1_st == 0)) && !(T1_E == 0)) && local + 1 <= token) && t1_pc == 1) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && token < local + 2) && 2 <= E_M)) || (((((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(T1_E == 0)) && m_pc == 0) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || ((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(T1_E == 0)) && !(m_st == 0)) && t1_pc == 1) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || (((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && !(m_st == 0)) && !(T1_E == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M)) || (((((((((!(E_1 == 0) && \result == 0) && tmp == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0)) && m_pc == 0) - InvariantResult [Line: 202]: Loop Invariant Derived loop invariant: ((((((((((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M) || ((((((((((!(E_1 == 0) && t1_pc == 1) && tmp == 0) && !(E_1 == 1)) && !(T1_E == 1)) && t1_i == 1) && token <= local) && local <= token) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0))) || (((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(t1_st == 0)) && !(m_st == 0)) && !(T1_E == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M)) || ((((((((((local + 1 <= token && !(E_1 == 0)) && t1_pc == 1) && !(E_1 == 1)) && !(T1_E == 1)) && t1_i == 1) && token < local + 2) && !(t1_st == 0)) && m_st == 0) && !(T1_E == 0)) && 2 <= E_M)) || (((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && t1_pc == 1) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || (((((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(T1_E == 0)) && m_pc == 0) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || (((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && !(m_st == 0)) && !(T1_E == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M)) || (((((((((!(E_1 == 0) && \result == 0) && tmp == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0)) && m_pc == 0)) || ((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && !(T1_E == 1)) && t1_i == 1) && !(t1_st == 0)) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0)) - InvariantResult [Line: 134]: Loop Invariant Derived loop invariant: ((((((((((((((((((!(E_1 == 0) && \result == 0) && __retres1 == 0) && tmp == 0) && !(E_1 == 1)) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(t1_st == 0)) && !(m_st == 0)) && !(T1_E == 0)) && 2 <= E_M) || (((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && \result == 0) && __retres1 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || (((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(T1_E == 0)) && m_pc == 0) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || (((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && !(t1_st == 0)) && !(T1_E == 0)) && local + 1 <= token) && t1_pc == 1) && \result == 0) && __retres1 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && token < local + 2) && 2 <= E_M)) || (((((((((((!(t1_pc == 1) && !(E_1 == 0)) && \result == 0) && __retres1 == 0) && tmp == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(t1_st == 0)) && !(m_st == 0)) && !(T1_E == 0)) && 2 <= E_M)) || (((((((((((!(E_1 == 0) && !(t1_pc == 1)) && \result == 0) && tmp == 0) && __retres1 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && 2 <= E_M)) || (((((((((((!(E_1 == 0) && !(t1_pc == 1)) && \result == 0) && tmp == 0) && __retres1 == 0) && !(E_1 == 1)) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(m_st == 0)) && !(T1_E == 0)) && 2 <= E_M)) || ((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(m_st == 0)) && !(T1_E == 0)) && \result == 0) && __retres1 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || (((((((((!(E_1 == 0) && \result == 0) && tmp == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(m_st == 0)) && !(T1_E == 0)) && 2 <= E_M) && m_pc == 0) - InvariantResult [Line: 131]: Loop Invariant Derived loop invariant: (((((((((((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(T1_E == 0)) && m_pc == 0) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M) || ((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M)) || ((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && !(m_st == 0)) && !(T1_E == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M)) || ((((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && !(t1_st == 0)) && !(T1_E == 0)) && local + 1 <= token) && t1_pc == 1) && \result == 0) && __retres1 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && token < local + 2) && 2 <= E_M)) || ((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && !(t1_st == 0)) && !(m_st == 0)) && !(T1_E == 0)) && \result == 0) && __retres1 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M)) || ((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(t1_st == 0)) && !(m_st == 0)) && !(T1_E == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M)) || ((((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && \result == 0) && __retres1 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || (((((((((!(E_1 == 0) && \result == 0) && tmp == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(m_st == 0)) && !(T1_E == 0)) && 2 <= E_M) && m_pc == 0)) || (((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(m_st == 0)) && !(T1_E == 0)) && \result == 0) && __retres1 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M) - InvariantResult [Line: 131]: Loop Invariant Derived loop invariant: (((((((((((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(T1_E == 0)) && m_pc == 0) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M) || ((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && !(m_st == 0)) && !(T1_E == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M)) || ((((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && !(t1_st == 0)) && !(T1_E == 0)) && local + 1 <= token) && t1_pc == 1) && \result == 0) && __retres1 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && token < local + 2) && 2 <= E_M)) || ((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M)) || ((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && !(t1_st == 0)) && !(m_st == 0)) && !(T1_E == 0)) && \result == 0) && __retres1 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M)) || ((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(t1_st == 0)) && !(m_st == 0)) && !(T1_E == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M)) || ((((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && \result == 0) && __retres1 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || (((((((((!(E_1 == 0) && \result == 0) && tmp == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(m_st == 0)) && !(T1_E == 0)) && 2 <= E_M) && m_pc == 0)) || (((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(m_st == 0)) && !(T1_E == 0)) && \result == 0) && __retres1 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M) - InvariantResult [Line: 131]: Loop Invariant Derived loop invariant: ((((((((((\result == 0 && !(E_1 == 0)) && __retres1 == 0) && tmp == 0) && !(E_1 == 1)) && !(T1_E == 1)) && t1_i == 1) && !(t1_st == 0)) && !(T1_E == 0)) && !(m_st == 0)) || (((((((((((\result == 0 && !(E_1 == 0)) && local + 1 <= token) && t1_pc == 1) && __retres1 == 0) && !(E_1 == 1)) && !(T1_E == 1)) && t1_i == 1) && token < local + 2) && !(t1_st == 0)) && m_st == 0) && !(T1_E == 0))) || ((((((((!(E_1 == 0) && \result == 0) && tmp == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(T1_E == 0)) && !(m_st == 0)) && m_pc == 0) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((((local + 1 <= token && !(E_1 == 0)) && t1_pc == 1) && !(E_1 == 1)) && !(T1_E == 1)) && t1_i == 1) && token < local + 2) && m_st == 0) && !(T1_E == 0)) || ((((((((!(E_1 == 0) && \result == 0) && tmp == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(T1_E == 0)) && m_pc == 0) && !(m_st == 0))) || ((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && !(T1_E == 1)) && t1_i == 1) && !(T1_E == 0)) && !(m_st == 0)) - InvariantResult [Line: 131]: Loop Invariant Derived loop invariant: ((((((((((((\result == 0 && !(t1_pc == 1)) && !(E_1 == 0)) && \result == 0) && __retres1 == 0) && tmp == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0)) || ((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && !(t1_st == 0)) && !(m_st == 0)) && !(T1_E == 0)) && \result == 0) && __retres1 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M)) || ((((((((((((!(E_1 == 0) && tmp == 0) && token <= local) && !(t1_st == 0)) && !(T1_E == 0)) && !(m_st == 0)) && t1_pc == 1) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M) - InvariantResult [Line: 439]: Loop Invariant Derived loop invariant: ((((((((((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M) || (((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(t1_st == 0)) && !(m_st == 0)) && !(T1_E == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M)) || (((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && t1_pc == 1) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || ((((((((((!(E_1 == 0) && \result == 0) && tmp == 0) && !(E_1 == 1)) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(t1_st == 0)) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0))) || ((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && !(t1_st == 0)) && !(T1_E == 0)) && local + 1 <= token) && t1_pc == 1) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && token < local + 2) && 2 <= E_M)) || (((((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(T1_E == 0)) && m_pc == 0) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || ((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(T1_E == 0)) && !(m_st == 0)) && t1_pc == 1) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || (((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && !(m_st == 0)) && !(T1_E == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M)) || (((((((((!(E_1 == 0) && \result == 0) && tmp == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0)) && m_pc == 0) - InvariantResult [Line: 131]: Loop Invariant Derived loop invariant: ((((((((((((((\result == 0 && E_1 == M_E) && tmp == 0) && T1_E == M_E) && token <= local) && M_E == 2) && m_pc == 0) && \result == 0) && __retres1 == 0) && __retres1 == 0) && t1_st == 0) && m_pc == t1_pc) && t1_i == 1) && local <= token) && 2 <= E_M) || (((((((((((((\result == 0 && E_1 == M_E) && tmp == 0) && T1_E == M_E) && M_E == 2) && !(m_st == 0)) && m_pc == 0) && \result == 0) && __retres1 == 0) && __retres1 == 0) && t1_st == 0) && m_pc == t1_pc) && t1_i == 1) && 2 <= E_M) - InvariantResult [Line: 112]: Loop Invariant Derived loop invariant: (((((((((((!(E_1 == 0) && t1_pc == 1) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && token <= local) && t1_i == 1) && !(t1_st == 0)) && local <= token) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0)) || ((((((((((\result == 0 && !(t1_pc == 1)) && !(E_1 == 0)) && \result == 0) && __retres1 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0)) - InvariantResult [Line: 112]: Loop Invariant Derived loop invariant: ((((((((((E_1 == M_E && \result == 0) && __retres1 == 0) && t1_st == 0) && m_pc == t1_pc) && T1_E == M_E) && M_E == 2) && t1_i == 1) && !(m_st == 0)) && m_pc == 0) && 2 <= E_M) || (((((((((((E_1 == M_E && \result == 0) && __retres1 == 0) && t1_st == 0) && m_pc == t1_pc) && T1_E == M_E) && token <= local) && M_E == 2) && t1_i == 1) && local <= token) && m_pc == 0) && 2 <= E_M) - InvariantResult [Line: 279]: Loop Invariant Derived loop invariant: (((((((((((((((\result == 0 && E_1 == M_E) && tmp == 0) && T1_E == M_E) && token <= local) && M_E == 2) && m_pc == 0) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && t1_st == 0) && m_pc == t1_pc) && t1_i == 1) && local <= token) && 2 <= E_M) || ((((((((((((((\result == 0 && E_1 == M_E) && tmp == 0) && T1_E == M_E) && M_E == 2) && !(m_st == 0)) && m_pc == 0) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && t1_st == 0) && m_pc == t1_pc) && t1_i == 1) && 2 <= E_M) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((((((!(E_1 == 0) && t1_pc == 1) && \result == 0) && tmp == 0) && __retres1 == 0) && !(T1_E == 1)) && token <= local) && t1_i == 1) && local <= token) && !(T1_E == 0)) && !(m_st == 0)) && 2 <= E_M) || (((((((((!(E_1 == 0) && \result == 0) && tmp == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(t1_st == 0)) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0))) || ((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(T1_E == 0)) && !(m_st == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M) - InvariantResult [Line: 464]: Loop Invariant Derived loop invariant: t1_i == 1 - InvariantResult [Line: 150]: Loop Invariant Derived loop invariant: ((((((((((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M) || ((((((((((!(E_1 == 0) && t1_pc == 1) && tmp == 0) && !(E_1 == 1)) && !(T1_E == 1)) && t1_i == 1) && token <= local) && local <= token) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0))) || (((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(t1_st == 0)) && !(m_st == 0)) && !(T1_E == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M)) || ((((((((((local + 1 <= token && !(E_1 == 0)) && t1_pc == 1) && !(E_1 == 1)) && !(T1_E == 1)) && t1_i == 1) && token < local + 2) && !(t1_st == 0)) && m_st == 0) && !(T1_E == 0)) && 2 <= E_M)) || (((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && t1_pc == 1) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || (((((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(T1_E == 0)) && m_pc == 0) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || (((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && !(m_st == 0)) && !(T1_E == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M)) || (((((((((!(E_1 == 0) && \result == 0) && tmp == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0)) && m_pc == 0)) || ((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && !(T1_E == 1)) && t1_i == 1) && !(t1_st == 0)) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0)) - InvariantResult [Line: 339]: Loop Invariant Derived loop invariant: ((((((((((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M) || (((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(t1_st == 0)) && !(m_st == 0)) && !(T1_E == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M)) || (((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && t1_pc == 1) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || ((((((((((!(E_1 == 0) && \result == 0) && tmp == 0) && !(E_1 == 1)) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(t1_st == 0)) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0))) || ((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && !(t1_st == 0)) && !(T1_E == 0)) && local + 1 <= token) && t1_pc == 1) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && token < local + 2) && 2 <= E_M)) || (((((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(T1_E == 0)) && m_pc == 0) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || ((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(T1_E == 0)) && !(m_st == 0)) && t1_pc == 1) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || (((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && !(m_st == 0)) && !(T1_E == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M)) || (((((((((!(E_1 == 0) && \result == 0) && tmp == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0)) && m_pc == 0) - InvariantResult [Line: 162]: Loop Invariant Derived loop invariant: (((((((((E_1 == M_E && t1_st == 0) && m_pc == t1_pc) && T1_E == M_E) && token <= local) && M_E == 2) && t1_i == 1) && m_st == 0) && local <= token) && m_pc == 0) && 2 <= E_M - InvariantResult [Line: 179]: Loop Invariant Derived loop invariant: ((((((((((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M) || (((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(t1_st == 0)) && !(m_st == 0)) && !(T1_E == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M)) || (((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && t1_pc == 1) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || ((((((((((!(E_1 == 0) && \result == 0) && tmp == 0) && !(E_1 == 1)) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(t1_st == 0)) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0))) || ((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && !(t1_st == 0)) && !(T1_E == 0)) && local + 1 <= token) && t1_pc == 1) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && token < local + 2) && 2 <= E_M)) || (((((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(T1_E == 0)) && m_pc == 0) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || ((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(T1_E == 0)) && !(m_st == 0)) && t1_pc == 1) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || (((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && !(m_st == 0)) && !(T1_E == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M)) || (((((((((!(E_1 == 0) && \result == 0) && tmp == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0)) && m_pc == 0) - InvariantResult [Line: 405]: Loop Invariant Derived loop invariant: t1_i == 1 - InvariantResult [Line: 275]: Loop Invariant Derived loop invariant: ((((((((((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M) || (((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(t1_st == 0)) && !(m_st == 0)) && !(T1_E == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M)) || (((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && t1_pc == 1) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || ((((((((((!(E_1 == 0) && \result == 0) && tmp == 0) && !(E_1 == 1)) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(t1_st == 0)) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0))) || ((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && !(t1_st == 0)) && !(T1_E == 0)) && local + 1 <= token) && t1_pc == 1) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && token < local + 2) && 2 <= E_M)) || (((((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(T1_E == 0)) && m_pc == 0) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || ((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(T1_E == 0)) && !(m_st == 0)) && t1_pc == 1) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || (((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && !(m_st == 0)) && !(T1_E == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M)) || (((((((((!(E_1 == 0) && \result == 0) && tmp == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0)) && m_pc == 0) - InvariantResult [Line: 115]: Loop Invariant Derived loop invariant: (((((((((((((((((!(E_1 == 0) && t1_pc == 1) && !(E_1 == 1)) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && token <= local) && local <= token) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0)) || ((((((((!(E_1 == 0) && !(E_1 == 1)) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(t1_st == 0)) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0))) || ((((((((((\result == 0 && !(t1_pc == 1)) && !(E_1 == 0)) && __retres1 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(t1_st == 0)) && !(T1_E == 0)) && 2 <= E_M) && m_pc == 0)) || ((((((((((\result == 0 && !(t1_pc == 1)) && !(E_1 == 0)) && __retres1 == 0) && !(E_1 == 1)) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(m_st == 0)) && !(T1_E == 0)) && 2 <= E_M)) || (((((((!(E_1 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0)) && m_pc == 0)) || ((((((((((((\result == 0 && !(E_1 == 0)) && !(E_1 == 1)) && token <= local) && !(T1_E == 0)) && m_pc == 0) && !(t1_pc == 1)) && __retres1 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || ((((((((((local + 1 <= token && !(E_1 == 0)) && t1_pc == 1) && !(E_1 == 1)) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && token < local + 2) && !(t1_st == 0)) && !(T1_E == 0)) && 2 <= E_M)) || ((((((((((\result == 0 && !(t1_pc == 1)) && !(E_1 == 0)) && __retres1 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(t1_st == 0)) && !(m_st == 0)) && !(T1_E == 0)) && 2 <= E_M)) || (((((((((((!(E_1 == 0) && t1_pc == 1) && !(E_1 == 1)) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && token <= local) && !(t1_st == 0)) && local <= token) && !(T1_E == 0)) && 2 <= E_M) && m_pc == 0) - InvariantResult [Line: 251]: Loop Invariant Derived loop invariant: ((((((((E_1 == M_E && t1_st == 0) && m_pc == t1_pc) && T1_E == M_E) && M_E == 2) && t1_i == 1) && !(m_st == 0)) && m_pc == 0) && 2 <= E_M) || (((((((((E_1 == M_E && t1_st == 0) && m_pc == t1_pc) && T1_E == M_E) && token <= local) && M_E == 2) && t1_i == 1) && local <= token) && m_pc == 0) && 2 <= E_M) - InvariantResult [Line: 115]: Loop Invariant Derived loop invariant: (((((((((((((((((!(E_1 == 0) && t1_pc == 1) && !(E_1 == 1)) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && token <= local) && local <= token) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0)) || ((((((((((\result == 0 && !(t1_pc == 1)) && !(E_1 == 0)) && __retres1 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(t1_st == 0)) && !(T1_E == 0)) && 2 <= E_M) && m_pc == 0)) || ((((((((!(E_1 == 0) && !(E_1 == 1)) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(t1_st == 0)) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0))) || ((((((((((\result == 0 && !(t1_pc == 1)) && !(E_1 == 0)) && __retres1 == 0) && !(E_1 == 1)) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(m_st == 0)) && !(T1_E == 0)) && 2 <= E_M)) || (((((((!(E_1 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0)) && m_pc == 0)) || ((((((((((((\result == 0 && !(E_1 == 0)) && !(E_1 == 1)) && token <= local) && !(T1_E == 0)) && m_pc == 0) && !(t1_pc == 1)) && __retres1 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || ((((((((((local + 1 <= token && !(E_1 == 0)) && t1_pc == 1) && !(E_1 == 1)) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && token < local + 2) && !(t1_st == 0)) && !(T1_E == 0)) && 2 <= E_M)) || ((((((((((\result == 0 && !(t1_pc == 1)) && !(E_1 == 0)) && __retres1 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(t1_st == 0)) && !(m_st == 0)) && !(T1_E == 0)) && 2 <= E_M)) || (((((((((((!(E_1 == 0) && t1_pc == 1) && !(E_1 == 1)) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && token <= local) && !(t1_st == 0)) && local <= token) && !(T1_E == 0)) && 2 <= E_M) && m_pc == 0) - InvariantResult [Line: 247]: Loop Invariant Derived loop invariant: ((((((((((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M) || ((((((((((!(E_1 == 0) && t1_pc == 1) && tmp == 0) && !(E_1 == 1)) && !(T1_E == 1)) && t1_i == 1) && token <= local) && local <= token) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0))) || (((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(t1_st == 0)) && !(m_st == 0)) && !(T1_E == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M)) || ((((((((((local + 1 <= token && !(E_1 == 0)) && t1_pc == 1) && !(E_1 == 1)) && !(T1_E == 1)) && t1_i == 1) && token < local + 2) && !(t1_st == 0)) && m_st == 0) && !(T1_E == 0)) && 2 <= E_M)) || (((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && t1_pc == 1) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || (((((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(T1_E == 0)) && m_pc == 0) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || (((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && !(m_st == 0)) && !(T1_E == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M)) || (((((((((!(E_1 == 0) && \result == 0) && tmp == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0)) && m_pc == 0)) || ((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && !(T1_E == 1)) && t1_i == 1) && !(t1_st == 0)) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0)) - InvariantResult [Line: 35]: Loop Invariant Derived loop invariant: (((((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(t1_st == 0)) && !(m_st == 0)) && !(T1_E == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M) || ((((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && !(T1_E == 0)) && m_pc == 0) && !(m_st == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M)) || (((((((((((!(E_1 == 0) && t1_pc == 1) && !(E_1 == 1)) && !(T1_E == 1)) && t1_i == 1) && token <= local) && !(t1_st == 0)) && local <= token) && !(T1_E == 0)) && 2 <= E_M) && m_pc == 0) && !(m_st == 0))) || ((((((((((local + 1 <= token && !(E_1 == 0)) && t1_pc == 1) && !(E_1 == 1)) && !(T1_E == 1)) && t1_i == 1) && token < local + 2) && !(t1_st == 0)) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0)) - InvariantResult [Line: 115]: Loop Invariant Derived loop invariant: ((((((((((!(E_1 == 0) && local + 1 <= token) && t1_pc == 1) && !(E_1 == 1)) && !(T1_E == 1)) && t1_i == 1) && token < local + 2) && !(t1_st == 0)) && !(T1_E == 0)) && !(m_st == 0)) || (((((((!(E_1 == 0) && !(E_1 == 1)) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(t1_st == 0)) && !(T1_E == 0)) && !(m_st == 0))) || ((((((!(E_1 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(T1_E == 0)) && !(m_st == 0)) && m_pc == 0) - InvariantResult [Line: 115]: Loop Invariant Derived loop invariant: (((((((((\result == 0 && !(t1_pc == 1)) && !(E_1 == 0)) && __retres1 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0)) || ((((((((((!(E_1 == 0) && t1_pc == 1) && __retres1 == 0) && !(T1_E == 1)) && token <= local) && t1_i == 1) && !(t1_st == 0)) && local <= token) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0)) - InvariantResult [Line: 247]: Loop Invariant Derived loop invariant: ((((((((E_1 == M_E && t1_st == 0) && m_pc == t1_pc) && T1_E == M_E) && M_E == 2) && t1_i == 1) && !(m_st == 0)) && m_pc == 0) && 2 <= E_M) || (((((((((E_1 == M_E && t1_st == 0) && m_pc == t1_pc) && T1_E == M_E) && token <= local) && M_E == 2) && t1_i == 1) && local <= token) && m_pc == 0) && 2 <= E_M) - InvariantResult [Line: 179]: Loop Invariant Derived loop invariant: ((((((((((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M) || (((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(t1_st == 0)) && !(m_st == 0)) && !(T1_E == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M)) || (((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && t1_pc == 1) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || ((((((((((!(E_1 == 0) && \result == 0) && tmp == 0) && !(E_1 == 1)) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(t1_st == 0)) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0))) || ((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && !(t1_st == 0)) && !(T1_E == 0)) && local + 1 <= token) && t1_pc == 1) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && token < local + 2) && 2 <= E_M)) || (((((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(T1_E == 0)) && m_pc == 0) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || ((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(T1_E == 0)) && !(m_st == 0)) && t1_pc == 1) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || (((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && !(m_st == 0)) && !(T1_E == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M)) || (((((((((!(E_1 == 0) && \result == 0) && tmp == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0)) && m_pc == 0) - InvariantResult [Line: 179]: Loop Invariant Derived loop invariant: ((((((((((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M) || ((((((((((!(E_1 == 0) && t1_pc == 1) && tmp == 0) && !(E_1 == 1)) && !(T1_E == 1)) && t1_i == 1) && token <= local) && local <= token) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0))) || (((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(t1_st == 0)) && !(m_st == 0)) && !(T1_E == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M)) || ((((((((((local + 1 <= token && !(E_1 == 0)) && t1_pc == 1) && !(E_1 == 1)) && !(T1_E == 1)) && t1_i == 1) && token < local + 2) && !(t1_st == 0)) && m_st == 0) && !(T1_E == 0)) && 2 <= E_M)) || (((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && t1_pc == 1) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || (((((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(T1_E == 0)) && m_pc == 0) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || (((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && !(m_st == 0)) && !(T1_E == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M)) || (((((((((!(E_1 == 0) && \result == 0) && tmp == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0)) && m_pc == 0)) || ((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && !(T1_E == 1)) && t1_i == 1) && !(t1_st == 0)) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0)) - InvariantResult [Line: 390]: Loop Invariant Derived loop invariant: ((((((((((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M) || (((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(t1_st == 0)) && !(m_st == 0)) && !(T1_E == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M)) || (((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && t1_pc == 1) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || ((((((((((!(E_1 == 0) && \result == 0) && tmp == 0) && !(E_1 == 1)) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(t1_st == 0)) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0))) || ((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && !(t1_st == 0)) && !(T1_E == 0)) && local + 1 <= token) && t1_pc == 1) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && token < local + 2) && 2 <= E_M)) || (((((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(T1_E == 0)) && m_pc == 0) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || ((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(T1_E == 0)) && !(m_st == 0)) && t1_pc == 1) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || (((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && !(m_st == 0)) && !(T1_E == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M)) || (((((((((!(E_1 == 0) && \result == 0) && tmp == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0)) && m_pc == 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 142 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 5.4s, OverallIterations: 17, TraceHistogramMax: 3, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 19.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 3493 SDtfs, 4846 SDslu, 3481 SDs, 0 SdLazy, 442 SolverSat, 162 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 72 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2384occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.2s AutomataMinimizationTime, 17 MinimizatonAttempts, 1336 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 52 LocationsWithAnnotation, 52 PreInvPairs, 754 NumberOfFragments, 13062 HoareAnnotationTreeSize, 52 FomulaSimplifications, 173500 FormulaSimplificationTreeSizeReduction, 2.3s HoareSimplificationTime, 52 FomulaSimplificationsInter, 52495 FormulaSimplificationTreeSizeReductionInter, 17.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 1006 NumberOfCodeBlocks, 1006 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 989 ConstructedInterpolants, 0 QuantifiedInterpolants, 137219 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 174/174 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...