./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 9a8b2e8d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/systemc/token_ring.01.cil-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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.1.25-9a8b2e8 [2020-10-20 01:50:30,486 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-20 01:50:30,489 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-20 01:50:30,525 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-20 01:50:30,526 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-20 01:50:30,535 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-20 01:50:30,537 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-20 01:50:30,541 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-20 01:50:30,543 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-20 01:50:30,546 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-20 01:50:30,548 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-20 01:50:30,549 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-20 01:50:30,549 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-20 01:50:30,552 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-20 01:50:30,553 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-20 01:50:30,555 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-20 01:50:30,556 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-20 01:50:30,557 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-20 01:50:30,559 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-20 01:50:30,567 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-20 01:50:30,570 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-20 01:50:30,571 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-20 01:50:30,573 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-20 01:50:30,573 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-20 01:50:30,596 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-20 01:50:30,597 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-20 01:50:30,597 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-20 01:50:30,600 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-20 01:50:30,601 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-20 01:50:30,602 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-20 01:50:30,603 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-20 01:50:30,604 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-20 01:50:30,605 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-20 01:50:30,608 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-20 01:50:30,611 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-20 01:50:30,611 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-20 01:50:30,612 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-20 01:50:30,614 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-20 01:50:30,614 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-20 01:50:30,615 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-20 01:50:30,616 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-20 01:50:30,617 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-10-20 01:50:30,653 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-20 01:50:30,653 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-20 01:50:30,655 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-20 01:50:30,656 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-20 01:50:30,656 INFO L138 SettingsManager]: * Use SBE=true [2020-10-20 01:50:30,656 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-20 01:50:30,657 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-20 01:50:30,657 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-20 01:50:30,657 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-20 01:50:30,657 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-20 01:50:30,658 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-20 01:50:30,659 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-20 01:50:30,659 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-20 01:50:30,659 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-20 01:50:30,659 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-20 01:50:30,660 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-20 01:50:30,660 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-20 01:50:30,660 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-20 01:50:30,660 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-20 01:50:30,661 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-20 01:50:30,661 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-20 01:50:30,661 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-20 01:50:30,662 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-20 01:50:30,662 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-20 01:50:30,662 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-20 01:50:30,662 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-20 01:50:30,663 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-20 01:50:30,663 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-20 01:50:30,663 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-20 01:50:30,663 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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-10-20 01:50:30,900 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-20 01:50:30,912 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-20 01:50:30,916 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-20 01:50:30,917 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-20 01:50:30,918 INFO L275 PluginConnector]: CDTParser initialized [2020-10-20 01:50:30,919 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/token_ring.01.cil-1.c [2020-10-20 01:50:30,983 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/82b9a6644/195877845a7f4ce1b7166695841770c0/FLAG4de890ee8 [2020-10-20 01:50:31,435 INFO L306 CDTParser]: Found 1 translation units. [2020-10-20 01:50:31,436 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.01.cil-1.c [2020-10-20 01:50:31,445 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/82b9a6644/195877845a7f4ce1b7166695841770c0/FLAG4de890ee8 [2020-10-20 01:50:31,868 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/82b9a6644/195877845a7f4ce1b7166695841770c0 [2020-10-20 01:50:31,872 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-20 01:50:31,879 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-20 01:50:31,880 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-20 01:50:31,881 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-20 01:50:31,885 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-20 01:50:31,886 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 01:50:31" (1/1) ... [2020-10-20 01:50:31,892 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f9b93dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:50:31, skipping insertion in model container [2020-10-20 01:50:31,892 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 01:50:31" (1/1) ... [2020-10-20 01:50:31,900 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-20 01:50:31,959 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-20 01:50:32,340 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 01:50:32,357 INFO L203 MainTranslator]: Completed pre-run [2020-10-20 01:50:32,433 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 01:50:32,466 INFO L208 MainTranslator]: Completed translation [2020-10-20 01:50:32,468 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:50:32 WrapperNode [2020-10-20 01:50:32,468 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-20 01:50:32,469 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-20 01:50:32,469 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-20 01:50:32,470 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-20 01:50:32,478 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:50:32" (1/1) ... [2020-10-20 01:50:32,502 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:50:32" (1/1) ... [2020-10-20 01:50:32,536 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-20 01:50:32,537 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-20 01:50:32,537 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-20 01:50:32,537 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-20 01:50:32,547 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:50:32" (1/1) ... [2020-10-20 01:50:32,548 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:50:32" (1/1) ... [2020-10-20 01:50:32,551 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:50:32" (1/1) ... [2020-10-20 01:50:32,552 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:50:32" (1/1) ... [2020-10-20 01:50:32,560 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:50:32" (1/1) ... [2020-10-20 01:50:32,569 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:50:32" (1/1) ... [2020-10-20 01:50:32,573 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:50:32" (1/1) ... [2020-10-20 01:50:32,577 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-20 01:50:32,577 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-20 01:50:32,578 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-20 01:50:32,578 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-20 01:50:32,579 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:50:32" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-20 01:50:32,648 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-20 01:50:32,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-20 01:50:32,649 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-20 01:50:32,649 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-20 01:50:33,255 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-20 01:50:33,256 INFO L298 CfgBuilder]: Removed 82 assume(true) statements. [2020-10-20 01:50:33,258 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 01:50:33 BoogieIcfgContainer [2020-10-20 01:50:33,258 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-20 01:50:33,260 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-20 01:50:33,260 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-20 01:50:33,264 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-20 01:50:33,264 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.10 01:50:31" (1/3) ... [2020-10-20 01:50:33,265 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37557392 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.10 01:50:33, skipping insertion in model container [2020-10-20 01:50:33,265 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:50:32" (2/3) ... [2020-10-20 01:50:33,266 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37557392 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.10 01:50:33, skipping insertion in model container [2020-10-20 01:50:33,266 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 01:50:33" (3/3) ... [2020-10-20 01:50:33,268 INFO L111 eAbstractionObserver]: Analyzing ICFG token_ring.01.cil-1.c [2020-10-20 01:50:33,280 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-20 01:50:33,288 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-20 01:50:33,302 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-10-20 01:50:33,329 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-20 01:50:33,330 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-20 01:50:33,330 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-20 01:50:33,330 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-20 01:50:33,331 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-20 01:50:33,331 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-20 01:50:33,331 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-20 01:50:33,331 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-20 01:50:33,354 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states. [2020-10-20 01:50:33,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-10-20 01:50:33,362 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:50:33,363 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-10-20 01:50:33,364 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:50:33,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:50:33,369 INFO L82 PathProgramCache]: Analyzing trace with hash 754195226, now seen corresponding path program 1 times [2020-10-20 01:50:33,377 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:50:33,378 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949467390] [2020-10-20 01:50:33,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:50:33,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:50:33,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:50:33,564 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949467390] [2020-10-20 01:50:33,565 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:50:33,566 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 01:50:33,567 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757846553] [2020-10-20 01:50:33,572 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 01:50:33,572 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:50:33,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 01:50:33,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:50:33,587 INFO L87 Difference]: Start difference. First operand 142 states. Second operand 3 states. [2020-10-20 01:50:33,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:50:33,676 INFO L93 Difference]: Finished difference Result 278 states and 432 transitions. [2020-10-20 01:50:33,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 01:50:33,683 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2020-10-20 01:50:33,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:50:33,703 INFO L225 Difference]: With dead ends: 278 [2020-10-20 01:50:33,703 INFO L226 Difference]: Without dead ends: 137 [2020-10-20 01:50:33,709 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-10-20 01:50:33,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2020-10-20 01:50:33,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2020-10-20 01:50:33,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2020-10-20 01:50:33,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 205 transitions. [2020-10-20 01:50:33,759 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 205 transitions. Word has length 39 [2020-10-20 01:50:33,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:50:33,760 INFO L481 AbstractCegarLoop]: Abstraction has 137 states and 205 transitions. [2020-10-20 01:50:33,760 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 01:50:33,760 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 205 transitions. [2020-10-20 01:50:33,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-10-20 01:50:33,761 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:50:33,762 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-10-20 01:50:33,762 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-20 01:50:33,762 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:50:33,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:50:33,763 INFO L82 PathProgramCache]: Analyzing trace with hash 1598200728, now seen corresponding path program 1 times [2020-10-20 01:50:33,763 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:50:33,763 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987726081] [2020-10-20 01:50:33,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:50:33,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:50:33,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:50:33,825 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987726081] [2020-10-20 01:50:33,825 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:50:33,825 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-20 01:50:33,826 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109396196] [2020-10-20 01:50:33,830 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 01:50:33,831 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:50:33,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 01:50:33,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:50:33,831 INFO L87 Difference]: Start difference. First operand 137 states and 205 transitions. Second operand 3 states. [2020-10-20 01:50:33,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:50:33,908 INFO L93 Difference]: Finished difference Result 363 states and 543 transitions. [2020-10-20 01:50:33,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 01:50:33,909 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2020-10-20 01:50:33,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:50:33,911 INFO L225 Difference]: With dead ends: 363 [2020-10-20 01:50:33,912 INFO L226 Difference]: Without dead ends: 232 [2020-10-20 01:50:33,913 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-10-20 01:50:33,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2020-10-20 01:50:33,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 230. [2020-10-20 01:50:33,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2020-10-20 01:50:33,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 341 transitions. [2020-10-20 01:50:33,980 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 341 transitions. Word has length 39 [2020-10-20 01:50:33,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:50:33,981 INFO L481 AbstractCegarLoop]: Abstraction has 230 states and 341 transitions. [2020-10-20 01:50:33,981 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 01:50:33,981 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 341 transitions. [2020-10-20 01:50:33,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-10-20 01:50:33,984 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:50:33,984 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-10-20 01:50:33,987 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-20 01:50:33,987 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:50:33,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:50:33,988 INFO L82 PathProgramCache]: Analyzing trace with hash 1655040020, now seen corresponding path program 1 times [2020-10-20 01:50:33,988 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:50:33,988 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420914160] [2020-10-20 01:50:33,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:50:34,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:50:34,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:50:34,052 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420914160] [2020-10-20 01:50:34,052 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:50:34,052 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 01:50:34,053 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144746777] [2020-10-20 01:50:34,053 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-20 01:50:34,054 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:50:34,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 01:50:34,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 01:50:34,055 INFO L87 Difference]: Start difference. First operand 230 states and 341 transitions. Second operand 4 states. [2020-10-20 01:50:34,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:50:34,145 INFO L93 Difference]: Finished difference Result 547 states and 810 transitions. [2020-10-20 01:50:34,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-20 01:50:34,146 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2020-10-20 01:50:34,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:50:34,150 INFO L225 Difference]: With dead ends: 547 [2020-10-20 01:50:34,150 INFO L226 Difference]: Without dead ends: 324 [2020-10-20 01:50:34,152 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-10-20 01:50:34,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2020-10-20 01:50:34,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 230. [2020-10-20 01:50:34,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2020-10-20 01:50:34,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 338 transitions. [2020-10-20 01:50:34,179 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 338 transitions. Word has length 39 [2020-10-20 01:50:34,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:50:34,179 INFO L481 AbstractCegarLoop]: Abstraction has 230 states and 338 transitions. [2020-10-20 01:50:34,179 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-20 01:50:34,180 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 338 transitions. [2020-10-20 01:50:34,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-10-20 01:50:34,181 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:50:34,181 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-10-20 01:50:34,182 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-20 01:50:34,182 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:50:34,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:50:34,183 INFO L82 PathProgramCache]: Analyzing trace with hash 1582653462, now seen corresponding path program 1 times [2020-10-20 01:50:34,183 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:50:34,183 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900094776] [2020-10-20 01:50:34,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:50:34,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:50:34,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:50:34,272 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900094776] [2020-10-20 01:50:34,272 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:50:34,272 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-20 01:50:34,272 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048612729] [2020-10-20 01:50:34,273 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 01:50:34,274 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:50:34,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 01:50:34,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:50:34,275 INFO L87 Difference]: Start difference. First operand 230 states and 338 transitions. Second operand 3 states. [2020-10-20 01:50:34,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:50:34,336 INFO L93 Difference]: Finished difference Result 452 states and 666 transitions. [2020-10-20 01:50:34,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 01:50:34,336 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2020-10-20 01:50:34,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:50:34,338 INFO L225 Difference]: With dead ends: 452 [2020-10-20 01:50:34,338 INFO L226 Difference]: Without dead ends: 230 [2020-10-20 01:50:34,340 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-10-20 01:50:34,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2020-10-20 01:50:34,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 230. [2020-10-20 01:50:34,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2020-10-20 01:50:34,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 324 transitions. [2020-10-20 01:50:34,360 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 324 transitions. Word has length 39 [2020-10-20 01:50:34,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:50:34,361 INFO L481 AbstractCegarLoop]: Abstraction has 230 states and 324 transitions. [2020-10-20 01:50:34,361 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 01:50:34,361 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 324 transitions. [2020-10-20 01:50:34,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-10-20 01:50:34,362 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:50:34,362 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-10-20 01:50:34,363 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-20 01:50:34,363 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:50:34,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:50:34,363 INFO L82 PathProgramCache]: Analyzing trace with hash 836344722, now seen corresponding path program 1 times [2020-10-20 01:50:34,364 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:50:34,364 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130068901] [2020-10-20 01:50:34,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:50:34,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:50:34,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:50:34,408 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130068901] [2020-10-20 01:50:34,408 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:50:34,418 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 01:50:34,418 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37846913] [2020-10-20 01:50:34,419 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-20 01:50:34,419 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:50:34,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 01:50:34,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 01:50:34,420 INFO L87 Difference]: Start difference. First operand 230 states and 324 transitions. Second operand 4 states. [2020-10-20 01:50:34,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:50:34,519 INFO L93 Difference]: Finished difference Result 529 states and 746 transitions. [2020-10-20 01:50:34,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-20 01:50:34,520 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2020-10-20 01:50:34,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:50:34,522 INFO L225 Difference]: With dead ends: 529 [2020-10-20 01:50:34,522 INFO L226 Difference]: Without dead ends: 308 [2020-10-20 01:50:34,523 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-10-20 01:50:34,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2020-10-20 01:50:34,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 230. [2020-10-20 01:50:34,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2020-10-20 01:50:34,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 321 transitions. [2020-10-20 01:50:34,542 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 321 transitions. Word has length 39 [2020-10-20 01:50:34,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:50:34,543 INFO L481 AbstractCegarLoop]: Abstraction has 230 states and 321 transitions. [2020-10-20 01:50:34,543 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-20 01:50:34,543 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 321 transitions. [2020-10-20 01:50:34,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-10-20 01:50:34,545 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:50:34,545 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-10-20 01:50:34,545 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-20 01:50:34,545 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:50:34,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:50:34,546 INFO L82 PathProgramCache]: Analyzing trace with hash 1537944596, now seen corresponding path program 1 times [2020-10-20 01:50:34,546 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:50:34,546 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050872947] [2020-10-20 01:50:34,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:50:34,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:50:34,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:50:34,604 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050872947] [2020-10-20 01:50:34,605 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:50:34,605 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 01:50:34,605 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464400997] [2020-10-20 01:50:34,606 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-20 01:50:34,606 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:50:34,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 01:50:34,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 01:50:34,606 INFO L87 Difference]: Start difference. First operand 230 states and 321 transitions. Second operand 4 states. [2020-10-20 01:50:34,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:50:34,753 INFO L93 Difference]: Finished difference Result 784 states and 1096 transitions. [2020-10-20 01:50:34,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-20 01:50:34,753 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2020-10-20 01:50:34,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:50:34,757 INFO L225 Difference]: With dead ends: 784 [2020-10-20 01:50:34,757 INFO L226 Difference]: Without dead ends: 565 [2020-10-20 01:50:34,758 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-10-20 01:50:34,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2020-10-20 01:50:34,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 519. [2020-10-20 01:50:34,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 519 states. [2020-10-20 01:50:34,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 712 transitions. [2020-10-20 01:50:34,809 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 712 transitions. Word has length 39 [2020-10-20 01:50:34,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:50:34,809 INFO L481 AbstractCegarLoop]: Abstraction has 519 states and 712 transitions. [2020-10-20 01:50:34,809 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-20 01:50:34,809 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 712 transitions. [2020-10-20 01:50:34,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-10-20 01:50:34,811 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:50:34,811 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-10-20 01:50:34,811 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-20 01:50:34,812 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:50:34,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:50:34,812 INFO L82 PathProgramCache]: Analyzing trace with hash -254561332, now seen corresponding path program 1 times [2020-10-20 01:50:34,812 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:50:34,813 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656601710] [2020-10-20 01:50:34,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:50:34,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:50:34,874 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-10-20 01:50:34,874 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656601710] [2020-10-20 01:50:34,874 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:50:34,874 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 01:50:34,875 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432865430] [2020-10-20 01:50:34,875 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-20 01:50:34,875 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:50:34,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 01:50:34,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-20 01:50:34,876 INFO L87 Difference]: Start difference. First operand 519 states and 712 transitions. Second operand 5 states. [2020-10-20 01:50:35,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:50:35,051 INFO L93 Difference]: Finished difference Result 1311 states and 1809 transitions. [2020-10-20 01:50:35,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-20 01:50:35,052 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2020-10-20 01:50:35,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:50:35,057 INFO L225 Difference]: With dead ends: 1311 [2020-10-20 01:50:35,057 INFO L226 Difference]: Without dead ends: 813 [2020-10-20 01:50:35,059 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-10-20 01:50:35,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 813 states. [2020-10-20 01:50:35,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 813 to 540. [2020-10-20 01:50:35,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 540 states. [2020-10-20 01:50:35,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 724 transitions. [2020-10-20 01:50:35,117 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 724 transitions. Word has length 51 [2020-10-20 01:50:35,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:50:35,118 INFO L481 AbstractCegarLoop]: Abstraction has 540 states and 724 transitions. [2020-10-20 01:50:35,118 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-20 01:50:35,118 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 724 transitions. [2020-10-20 01:50:35,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-10-20 01:50:35,119 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:50:35,120 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-10-20 01:50:35,120 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-20 01:50:35,120 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:50:35,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:50:35,121 INFO L82 PathProgramCache]: Analyzing trace with hash 447038542, now seen corresponding path program 1 times [2020-10-20 01:50:35,121 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:50:35,121 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207741369] [2020-10-20 01:50:35,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:50:35,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:50:35,160 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-10-20 01:50:35,160 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207741369] [2020-10-20 01:50:35,161 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:50:35,161 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 01:50:35,161 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589160502] [2020-10-20 01:50:35,162 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-20 01:50:35,162 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:50:35,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 01:50:35,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 01:50:35,163 INFO L87 Difference]: Start difference. First operand 540 states and 724 transitions. Second operand 4 states. [2020-10-20 01:50:35,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:50:35,293 INFO L93 Difference]: Finished difference Result 1284 states and 1724 transitions. [2020-10-20 01:50:35,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-20 01:50:35,294 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2020-10-20 01:50:35,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:50:35,298 INFO L225 Difference]: With dead ends: 1284 [2020-10-20 01:50:35,298 INFO L226 Difference]: Without dead ends: 767 [2020-10-20 01:50:35,300 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-10-20 01:50:35,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 767 states. [2020-10-20 01:50:35,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 767 to 540. [2020-10-20 01:50:35,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 540 states. [2020-10-20 01:50:35,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 711 transitions. [2020-10-20 01:50:35,346 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 711 transitions. Word has length 51 [2020-10-20 01:50:35,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:50:35,347 INFO L481 AbstractCegarLoop]: Abstraction has 540 states and 711 transitions. [2020-10-20 01:50:35,347 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-20 01:50:35,347 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 711 transitions. [2020-10-20 01:50:35,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-10-20 01:50:35,348 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:50:35,349 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-10-20 01:50:35,349 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-20 01:50:35,349 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:50:35,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:50:35,350 INFO L82 PathProgramCache]: Analyzing trace with hash 1833241936, now seen corresponding path program 1 times [2020-10-20 01:50:35,350 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:50:35,351 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467261474] [2020-10-20 01:50:35,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:50:35,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:50:35,390 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:50:35,390 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467261474] [2020-10-20 01:50:35,390 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:50:35,390 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 01:50:35,391 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301883054] [2020-10-20 01:50:35,391 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 01:50:35,392 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:50:35,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 01:50:35,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:50:35,393 INFO L87 Difference]: Start difference. First operand 540 states and 711 transitions. Second operand 3 states. [2020-10-20 01:50:35,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:50:35,514 INFO L93 Difference]: Finished difference Result 1511 states and 1975 transitions. [2020-10-20 01:50:35,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 01:50:35,515 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2020-10-20 01:50:35,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:50:35,520 INFO L225 Difference]: With dead ends: 1511 [2020-10-20 01:50:35,520 INFO L226 Difference]: Without dead ends: 996 [2020-10-20 01:50:35,522 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-10-20 01:50:35,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 996 states. [2020-10-20 01:50:35,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 996 to 960. [2020-10-20 01:50:35,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 960 states. [2020-10-20 01:50:35,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 960 states to 960 states and 1226 transitions. [2020-10-20 01:50:35,608 INFO L78 Accepts]: Start accepts. Automaton has 960 states and 1226 transitions. Word has length 51 [2020-10-20 01:50:35,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:50:35,608 INFO L481 AbstractCegarLoop]: Abstraction has 960 states and 1226 transitions. [2020-10-20 01:50:35,609 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 01:50:35,609 INFO L276 IsEmpty]: Start isEmpty. Operand 960 states and 1226 transitions. [2020-10-20 01:50:35,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-10-20 01:50:35,610 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:50:35,610 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-10-20 01:50:35,610 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-20 01:50:35,611 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:50:35,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:50:35,611 INFO L82 PathProgramCache]: Analyzing trace with hash 1279747345, now seen corresponding path program 1 times [2020-10-20 01:50:35,612 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:50:35,612 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463449137] [2020-10-20 01:50:35,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:50:35,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:50:35,667 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-20 01:50:35,667 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463449137] [2020-10-20 01:50:35,668 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:50:35,668 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-20 01:50:35,668 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455756335] [2020-10-20 01:50:35,668 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 01:50:35,669 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:50:35,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 01:50:35,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:50:35,669 INFO L87 Difference]: Start difference. First operand 960 states and 1226 transitions. Second operand 3 states. [2020-10-20 01:50:35,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:50:35,820 INFO L93 Difference]: Finished difference Result 2284 states and 2945 transitions. [2020-10-20 01:50:35,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 01:50:35,821 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2020-10-20 01:50:35,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:50:35,829 INFO L225 Difference]: With dead ends: 2284 [2020-10-20 01:50:35,830 INFO L226 Difference]: Without dead ends: 1602 [2020-10-20 01:50:35,831 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-10-20 01:50:35,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1602 states. [2020-10-20 01:50:35,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1602 to 1312. [2020-10-20 01:50:35,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1312 states. [2020-10-20 01:50:35,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1312 states to 1312 states and 1678 transitions. [2020-10-20 01:50:35,941 INFO L78 Accepts]: Start accepts. Automaton has 1312 states and 1678 transitions. Word has length 52 [2020-10-20 01:50:35,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:50:35,941 INFO L481 AbstractCegarLoop]: Abstraction has 1312 states and 1678 transitions. [2020-10-20 01:50:35,941 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 01:50:35,941 INFO L276 IsEmpty]: Start isEmpty. Operand 1312 states and 1678 transitions. [2020-10-20 01:50:35,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-10-20 01:50:35,943 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:50:35,943 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-10-20 01:50:35,943 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-20 01:50:35,943 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:50:35,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:50:35,944 INFO L82 PathProgramCache]: Analyzing trace with hash -272953241, now seen corresponding path program 1 times [2020-10-20 01:50:35,944 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:50:35,944 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774815425] [2020-10-20 01:50:35,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:50:35,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:50:35,996 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:50:35,996 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774815425] [2020-10-20 01:50:35,996 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:50:35,996 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 01:50:35,997 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957776516] [2020-10-20 01:50:35,997 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-20 01:50:35,997 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:50:35,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 01:50:35,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-20 01:50:35,998 INFO L87 Difference]: Start difference. First operand 1312 states and 1678 transitions. Second operand 5 states. [2020-10-20 01:50:36,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:50:36,206 INFO L93 Difference]: Finished difference Result 2538 states and 3250 transitions. [2020-10-20 01:50:36,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-20 01:50:36,207 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 63 [2020-10-20 01:50:36,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:50:36,215 INFO L225 Difference]: With dead ends: 2538 [2020-10-20 01:50:36,215 INFO L226 Difference]: Without dead ends: 1554 [2020-10-20 01:50:36,218 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-10-20 01:50:36,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1554 states. [2020-10-20 01:50:36,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1554 to 1324. [2020-10-20 01:50:36,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1324 states. [2020-10-20 01:50:36,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1324 states to 1324 states and 1656 transitions. [2020-10-20 01:50:36,346 INFO L78 Accepts]: Start accepts. Automaton has 1324 states and 1656 transitions. Word has length 63 [2020-10-20 01:50:36,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:50:36,346 INFO L481 AbstractCegarLoop]: Abstraction has 1324 states and 1656 transitions. [2020-10-20 01:50:36,346 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-20 01:50:36,347 INFO L276 IsEmpty]: Start isEmpty. Operand 1324 states and 1656 transitions. [2020-10-20 01:50:36,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-10-20 01:50:36,348 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:50:36,348 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-10-20 01:50:36,348 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-20 01:50:36,348 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:50:36,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:50:36,349 INFO L82 PathProgramCache]: Analyzing trace with hash 149748585, now seen corresponding path program 1 times [2020-10-20 01:50:36,349 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:50:36,350 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19163174] [2020-10-20 01:50:36,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:50:36,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:50:36,425 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:50:36,426 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19163174] [2020-10-20 01:50:36,426 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:50:36,428 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 01:50:36,429 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536198616] [2020-10-20 01:50:36,429 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 01:50:36,429 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:50:36,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 01:50:36,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:50:36,430 INFO L87 Difference]: Start difference. First operand 1324 states and 1656 transitions. Second operand 3 states. [2020-10-20 01:50:36,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:50:36,667 INFO L93 Difference]: Finished difference Result 3688 states and 4602 transitions. [2020-10-20 01:50:36,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 01:50:36,668 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2020-10-20 01:50:36,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:50:36,684 INFO L225 Difference]: With dead ends: 3688 [2020-10-20 01:50:36,685 INFO L226 Difference]: Without dead ends: 2410 [2020-10-20 01:50:36,689 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-10-20 01:50:36,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2410 states. [2020-10-20 01:50:36,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2410 to 2384. [2020-10-20 01:50:36,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2384 states. [2020-10-20 01:50:36,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2384 states to 2384 states and 2930 transitions. [2020-10-20 01:50:36,988 INFO L78 Accepts]: Start accepts. Automaton has 2384 states and 2930 transitions. Word has length 63 [2020-10-20 01:50:36,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:50:36,991 INFO L481 AbstractCegarLoop]: Abstraction has 2384 states and 2930 transitions. [2020-10-20 01:50:36,991 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 01:50:36,991 INFO L276 IsEmpty]: Start isEmpty. Operand 2384 states and 2930 transitions. [2020-10-20 01:50:36,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2020-10-20 01:50:36,992 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:50:36,993 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-10-20 01:50:36,993 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-20 01:50:36,993 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:50:36,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:50:36,994 INFO L82 PathProgramCache]: Analyzing trace with hash -200227224, now seen corresponding path program 1 times [2020-10-20 01:50:36,994 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:50:36,994 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104632809] [2020-10-20 01:50:36,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:50:37,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:50:37,065 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:50:37,065 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104632809] [2020-10-20 01:50:37,066 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:50:37,066 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 01:50:37,066 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526773725] [2020-10-20 01:50:37,067 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-20 01:50:37,067 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:50:37,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 01:50:37,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 01:50:37,068 INFO L87 Difference]: Start difference. First operand 2384 states and 2930 transitions. Second operand 4 states. [2020-10-20 01:50:37,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:50:37,470 INFO L93 Difference]: Finished difference Result 4190 states and 5144 transitions. [2020-10-20 01:50:37,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 01:50:37,470 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2020-10-20 01:50:37,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:50:37,483 INFO L225 Difference]: With dead ends: 4190 [2020-10-20 01:50:37,483 INFO L226 Difference]: Without dead ends: 1831 [2020-10-20 01:50:37,486 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-10-20 01:50:37,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1831 states. [2020-10-20 01:50:37,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1831 to 1829. [2020-10-20 01:50:37,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1829 states. [2020-10-20 01:50:37,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1829 states to 1829 states and 2207 transitions. [2020-10-20 01:50:37,624 INFO L78 Accepts]: Start accepts. Automaton has 1829 states and 2207 transitions. Word has length 64 [2020-10-20 01:50:37,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:50:37,624 INFO L481 AbstractCegarLoop]: Abstraction has 1829 states and 2207 transitions. [2020-10-20 01:50:37,625 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-20 01:50:37,626 INFO L276 IsEmpty]: Start isEmpty. Operand 1829 states and 2207 transitions. [2020-10-20 01:50:37,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2020-10-20 01:50:37,628 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:50:37,629 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-10-20 01:50:37,629 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-20 01:50:37,629 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:50:37,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:50:37,629 INFO L82 PathProgramCache]: Analyzing trace with hash 220559698, now seen corresponding path program 1 times [2020-10-20 01:50:37,630 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:50:37,634 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636358642] [2020-10-20 01:50:37,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:50:37,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:50:37,683 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-20 01:50:37,683 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636358642] [2020-10-20 01:50:37,684 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:50:37,684 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 01:50:37,685 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234178128] [2020-10-20 01:50:37,685 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-20 01:50:37,685 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:50:37,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 01:50:37,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 01:50:37,686 INFO L87 Difference]: Start difference. First operand 1829 states and 2207 transitions. Second operand 4 states. [2020-10-20 01:50:37,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:50:37,896 INFO L93 Difference]: Finished difference Result 3657 states and 4409 transitions. [2020-10-20 01:50:37,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 01:50:37,896 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2020-10-20 01:50:37,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:50:37,906 INFO L225 Difference]: With dead ends: 3657 [2020-10-20 01:50:37,906 INFO L226 Difference]: Without dead ends: 1586 [2020-10-20 01:50:37,910 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-10-20 01:50:37,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1586 states. [2020-10-20 01:50:38,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1586 to 1559. [2020-10-20 01:50:38,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1559 states. [2020-10-20 01:50:38,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1559 states to 1559 states and 1866 transitions. [2020-10-20 01:50:38,080 INFO L78 Accepts]: Start accepts. Automaton has 1559 states and 1866 transitions. Word has length 94 [2020-10-20 01:50:38,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:50:38,080 INFO L481 AbstractCegarLoop]: Abstraction has 1559 states and 1866 transitions. [2020-10-20 01:50:38,080 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-20 01:50:38,081 INFO L276 IsEmpty]: Start isEmpty. Operand 1559 states and 1866 transitions. [2020-10-20 01:50:38,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2020-10-20 01:50:38,082 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:50:38,083 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-10-20 01:50:38,083 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-20 01:50:38,083 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:50:38,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:50:38,084 INFO L82 PathProgramCache]: Analyzing trace with hash 579367125, now seen corresponding path program 1 times [2020-10-20 01:50:38,084 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:50:38,084 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608738484] [2020-10-20 01:50:38,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:50:38,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:50:38,134 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-20 01:50:38,135 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608738484] [2020-10-20 01:50:38,135 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:50:38,136 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 01:50:38,136 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170713426] [2020-10-20 01:50:38,137 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-20 01:50:38,137 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:50:38,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 01:50:38,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 01:50:38,138 INFO L87 Difference]: Start difference. First operand 1559 states and 1866 transitions. Second operand 4 states. [2020-10-20 01:50:38,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:50:38,282 INFO L93 Difference]: Finished difference Result 2553 states and 3030 transitions. [2020-10-20 01:50:38,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 01:50:38,282 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2020-10-20 01:50:38,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:50:38,286 INFO L225 Difference]: With dead ends: 2553 [2020-10-20 01:50:38,287 INFO L226 Difference]: Without dead ends: 704 [2020-10-20 01:50:38,289 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-10-20 01:50:38,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704 states. [2020-10-20 01:50:38,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 704 to 699. [2020-10-20 01:50:38,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 699 states. [2020-10-20 01:50:38,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 777 transitions. [2020-10-20 01:50:38,336 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 777 transitions. Word has length 94 [2020-10-20 01:50:38,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:50:38,336 INFO L481 AbstractCegarLoop]: Abstraction has 699 states and 777 transitions. [2020-10-20 01:50:38,337 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-20 01:50:38,337 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 777 transitions. [2020-10-20 01:50:38,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2020-10-20 01:50:38,338 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:50:38,338 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-10-20 01:50:38,338 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-20 01:50:38,339 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:50:38,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:50:38,339 INFO L82 PathProgramCache]: Analyzing trace with hash 219632562, now seen corresponding path program 1 times [2020-10-20 01:50:38,339 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:50:38,340 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844426562] [2020-10-20 01:50:38,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:50:38,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:50:38,379 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:50:38,380 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844426562] [2020-10-20 01:50:38,380 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:50:38,381 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 01:50:38,381 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682691546] [2020-10-20 01:50:38,381 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 01:50:38,382 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:50:38,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 01:50:38,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:50:38,382 INFO L87 Difference]: Start difference. First operand 699 states and 777 transitions. Second operand 3 states. [2020-10-20 01:50:38,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:50:38,455 INFO L93 Difference]: Finished difference Result 1019 states and 1137 transitions. [2020-10-20 01:50:38,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 01:50:38,455 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2020-10-20 01:50:38,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:50:38,459 INFO L225 Difference]: With dead ends: 1019 [2020-10-20 01:50:38,459 INFO L226 Difference]: Without dead ends: 582 [2020-10-20 01:50:38,460 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-10-20 01:50:38,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2020-10-20 01:50:38,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 582. [2020-10-20 01:50:38,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 582 states. [2020-10-20 01:50:38,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 641 transitions. [2020-10-20 01:50:38,539 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 641 transitions. Word has length 94 [2020-10-20 01:50:38,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:50:38,540 INFO L481 AbstractCegarLoop]: Abstraction has 582 states and 641 transitions. [2020-10-20 01:50:38,540 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 01:50:38,540 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 641 transitions. [2020-10-20 01:50:38,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2020-10-20 01:50:38,542 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:50:38,542 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-10-20 01:50:38,542 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-20 01:50:38,543 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:50:38,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:50:38,544 INFO L82 PathProgramCache]: Analyzing trace with hash -880867770, now seen corresponding path program 1 times [2020-10-20 01:50:38,544 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:50:38,544 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260108084] [2020-10-20 01:50:38,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:50:38,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:50:38,645 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-20 01:50:38,646 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260108084] [2020-10-20 01:50:38,646 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:50:38,646 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 01:50:38,647 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400882821] [2020-10-20 01:50:38,647 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-20 01:50:38,648 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:50:38,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 01:50:38,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 01:50:38,649 INFO L87 Difference]: Start difference. First operand 582 states and 641 transitions. Second operand 4 states. [2020-10-20 01:50:38,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:50:38,709 INFO L93 Difference]: Finished difference Result 586 states and 645 transitions. [2020-10-20 01:50:38,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-20 01:50:38,710 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2020-10-20 01:50:38,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:50:38,710 INFO L225 Difference]: With dead ends: 586 [2020-10-20 01:50:38,710 INFO L226 Difference]: Without dead ends: 0 [2020-10-20 01:50:38,712 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-10-20 01:50:38,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-10-20 01:50:38,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-10-20 01:50:38,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-10-20 01:50:38,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-10-20 01:50:38,713 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 95 [2020-10-20 01:50:38,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:50:38,714 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-20 01:50:38,714 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-20 01:50:38,714 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-10-20 01:50:38,714 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-10-20 01:50:38,715 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-20 01:50:38,717 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-10-20 01:50:38,948 WARN L193 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 118 [2020-10-20 01:50:39,193 WARN L193 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 91 [2020-10-20 01:50:39,549 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 91 [2020-10-20 01:50:39,936 WARN L193 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 91 [2020-10-20 01:50:40,049 WARN L193 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 77 [2020-10-20 01:50:40,185 WARN L193 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 91 [2020-10-20 01:50:41,991 WARN L193 SmtUtils]: Spent 528.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 54 [2020-10-20 01:50:42,298 WARN L193 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 48 [2020-10-20 01:50:42,867 WARN L193 SmtUtils]: Spent 567.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 58 [2020-10-20 01:50:43,043 WARN L193 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 44 [2020-10-20 01:50:43,570 WARN L193 SmtUtils]: Spent 524.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 60 [2020-10-20 01:50:43,793 WARN L193 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 42 [2020-10-20 01:50:44,248 WARN L193 SmtUtils]: Spent 452.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2020-10-20 01:50:44,409 WARN L193 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 37 [2020-10-20 01:50:44,916 WARN L193 SmtUtils]: Spent 505.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 54 [2020-10-20 01:50:45,173 WARN L193 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 39 [2020-10-20 01:50:45,737 WARN L193 SmtUtils]: Spent 561.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 60 [2020-10-20 01:50:45,895 WARN L193 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 41 [2020-10-20 01:50:46,068 WARN L193 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 31 [2020-10-20 01:50:46,629 WARN L193 SmtUtils]: Spent 556.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 58 [2020-10-20 01:50:47,156 WARN L193 SmtUtils]: Spent 523.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 58 [2020-10-20 01:50:47,720 WARN L193 SmtUtils]: Spent 561.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 58 [2020-10-20 01:50:48,278 WARN L193 SmtUtils]: Spent 555.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 60 [2020-10-20 01:50:48,843 WARN L193 SmtUtils]: Spent 564.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 58 [2020-10-20 01:50:49,399 WARN L193 SmtUtils]: Spent 553.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 60 [2020-10-20 01:50:49,916 WARN L193 SmtUtils]: Spent 515.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 58 [2020-10-20 01:50:50,379 WARN L193 SmtUtils]: Spent 460.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 54 [2020-10-20 01:50:50,900 WARN L193 SmtUtils]: Spent 518.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2020-10-20 01:50:51,451 WARN L193 SmtUtils]: Spent 549.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 56 [2020-10-20 01:50:51,649 WARN L193 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 46 [2020-10-20 01:50:51,887 WARN L193 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 40 [2020-10-20 01:50:52,146 WARN L193 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 45 [2020-10-20 01:50:52,718 WARN L193 SmtUtils]: Spent 570.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 58 [2020-10-20 01:50:52,894 WARN L193 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 39 [2020-10-20 01:50:53,035 WARN L193 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 39 [2020-10-20 01:50:53,173 WARN L193 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 33 [2020-10-20 01:50:53,367 WARN L193 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 41 [2020-10-20 01:50:53,626 WARN L193 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 44 [2020-10-20 01:50:54,184 WARN L193 SmtUtils]: Spent 554.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 60 [2020-10-20 01:50:54,710 WARN L193 SmtUtils]: Spent 524.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 58 [2020-10-20 01:50:55,320 WARN L193 SmtUtils]: Spent 562.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 58 [2020-10-20 01:50:55,890 WARN L193 SmtUtils]: Spent 566.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 58 [2020-10-20 01:50:56,293 WARN L193 SmtUtils]: Spent 402.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2020-10-20 01:50:56,405 WARN L193 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 29 [2020-10-20 01:50:56,862 WARN L193 SmtUtils]: Spent 455.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 52 [2020-10-20 01:50:57,420 WARN L193 SmtUtils]: Spent 554.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 60 [2020-10-20 01:50:57,724 WARN L193 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 54 [2020-10-20 01:50:57,880 WARN L193 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 37 [2020-10-20 01:50:58,011 WARN L193 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 37 [2020-10-20 01:50:58,124 WARN L193 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 29 [2020-10-20 01:50:58,687 WARN L193 SmtUtils]: Spent 561.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 58 [2020-10-20 01:50:59,238 WARN L193 SmtUtils]: Spent 549.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 60 [2020-10-20 01:50:59,806 WARN L193 SmtUtils]: Spent 565.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 58 [2020-10-20 01:50:59,810 INFO L274 CegarLoopResult]: For program point L135(lines 135 144) no Hoare annotation was computed. [2020-10-20 01:50:59,810 INFO L274 CegarLoopResult]: For program point L135-2(lines 135 144) no Hoare annotation was computed. [2020-10-20 01:50:59,811 INFO L274 CegarLoopResult]: For program point L36(lines 36 44) no Hoare annotation was computed. [2020-10-20 01:50:59,811 INFO L274 CegarLoopResult]: For program point L135-3(lines 135 144) no Hoare annotation was computed. [2020-10-20 01:50:59,811 INFO L274 CegarLoopResult]: For program point L3(line 3) no Hoare annotation was computed. [2020-10-20 01:50:59,811 INFO L274 CegarLoopResult]: For program point L135-5(lines 135 144) no Hoare annotation was computed. [2020-10-20 01:50:59,811 INFO L274 CegarLoopResult]: For program point L135-6(lines 135 144) no Hoare annotation was computed. [2020-10-20 01:50:59,811 INFO L274 CegarLoopResult]: For program point L135-8(lines 135 144) no Hoare annotation was computed. [2020-10-20 01:50:59,812 INFO L274 CegarLoopResult]: For program point L135-9(lines 135 144) no Hoare annotation was computed. [2020-10-20 01:50:59,812 INFO L274 CegarLoopResult]: For program point L135-11(lines 135 144) no Hoare annotation was computed. [2020-10-20 01:50:59,813 INFO L274 CegarLoopResult]: For program point L135-12(lines 135 144) no Hoare annotation was computed. [2020-10-20 01:50:59,813 INFO L274 CegarLoopResult]: For program point L135-14(lines 135 144) no Hoare annotation was computed. [2020-10-20 01:50:59,813 INFO L274 CegarLoopResult]: For program point L136(lines 136 141) no Hoare annotation was computed. [2020-10-20 01:50:59,813 INFO L274 CegarLoopResult]: For program point L136-1(lines 136 141) no Hoare annotation was computed. [2020-10-20 01:50:59,813 INFO L274 CegarLoopResult]: For program point L136-2(lines 136 141) no Hoare annotation was computed. [2020-10-20 01:50:59,814 INFO L274 CegarLoopResult]: For program point L136-3(lines 136 141) no Hoare annotation was computed. [2020-10-20 01:50:59,814 INFO L274 CegarLoopResult]: For program point L136-4(lines 136 141) no Hoare annotation was computed. [2020-10-20 01:50:59,815 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-10-20 01:50:59,815 INFO L274 CegarLoopResult]: For program point L203(line 203) no Hoare annotation was computed. [2020-10-20 01:50:59,816 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-10-20 01:50:59,816 INFO L274 CegarLoopResult]: For program point L39(lines 39 43) no Hoare annotation was computed. [2020-10-20 01:50:59,816 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-10-20 01:50:59,816 INFO L274 CegarLoopResult]: For program point L207(lines 207 211) no Hoare annotation was computed. [2020-10-20 01:50:59,816 INFO L274 CegarLoopResult]: For program point L207-1(lines 202 240) no Hoare annotation was computed. [2020-10-20 01:50:59,817 INFO L274 CegarLoopResult]: For program point L439(lines 439 448) no Hoare annotation was computed. [2020-10-20 01:50:59,817 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-10-20 01:50:59,818 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-10-20 01:50:59,818 INFO L270 CegarLoopResult]: At program point L473(lines 464 475) the Hoare annotation is: (= ~t1_i~0 1) [2020-10-20 01:50:59,818 INFO L274 CegarLoopResult]: For program point L12(line 12) no Hoare annotation was computed. [2020-10-20 01:50:59,818 INFO L274 CegarLoopResult]: For program point L311(lines 311 315) no Hoare annotation was computed. [2020-10-20 01:50:59,818 INFO L274 CegarLoopResult]: For program point L311-2(lines 311 315) no Hoare annotation was computed. [2020-10-20 01:50:59,818 INFO L274 CegarLoopResult]: For program point L311-3(lines 311 315) no Hoare annotation was computed. [2020-10-20 01:50:59,819 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-10-20 01:50:59,819 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-10-20 01:50:59,820 INFO L274 CegarLoopResult]: For program point L311-5(lines 311 315) no Hoare annotation was computed. [2020-10-20 01:50:59,820 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-10-20 01:50:59,820 INFO L274 CegarLoopResult]: For program point L311-6(lines 311 315) no Hoare annotation was computed. [2020-10-20 01:50:59,820 INFO L274 CegarLoopResult]: For program point L80(lines 80 88) no Hoare annotation was computed. [2020-10-20 01:50:59,821 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-10-20 01:50:59,821 INFO L274 CegarLoopResult]: For program point L311-8(lines 311 315) no Hoare annotation was computed. [2020-10-20 01:50:59,821 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-10-20 01:50:59,821 INFO L274 CegarLoopResult]: For program point L311-9(lines 311 315) no Hoare annotation was computed. [2020-10-20 01:50:59,821 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-10-20 01:50:59,821 INFO L274 CegarLoopResult]: For program point L311-11(lines 311 315) no Hoare annotation was computed. [2020-10-20 01:50:59,822 INFO L274 CegarLoopResult]: For program point L311-12(lines 311 315) no Hoare annotation was computed. [2020-10-20 01:50:59,822 INFO L274 CegarLoopResult]: For program point L311-14(lines 311 315) no Hoare annotation was computed. [2020-10-20 01:50:59,822 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-10-20 01:50:59,822 INFO L274 CegarLoopResult]: For program point L279-1(lines 278 301) no Hoare annotation was computed. [2020-10-20 01:50:59,822 INFO L274 CegarLoopResult]: For program point L180(lines 180 190) no Hoare annotation was computed. [2020-10-20 01:50:59,822 INFO L274 CegarLoopResult]: For program point L279-3(lines 278 301) no Hoare annotation was computed. [2020-10-20 01:50:59,822 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-10-20 01:50:59,822 INFO L274 CegarLoopResult]: For program point L180-1(lines 180 190) no Hoare annotation was computed. [2020-10-20 01:50:59,823 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-10-20 01:50:59,823 INFO L274 CegarLoopResult]: For program point L180-2(lines 180 190) no Hoare annotation was computed. [2020-10-20 01:50:59,823 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-10-20 01:50:59,823 INFO L274 CegarLoopResult]: For program point L48(line 48) no Hoare annotation was computed. [2020-10-20 01:50:59,823 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-10-20 01:50:59,823 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-10-20 01:50:59,824 INFO L274 CegarLoopResult]: For program point L215(lines 215 222) no Hoare annotation was computed. [2020-10-20 01:50:59,824 INFO L274 CegarLoopResult]: For program point L116(lines 116 125) no Hoare annotation was computed. [2020-10-20 01:50:59,824 INFO L274 CegarLoopResult]: For program point L83(lines 83 87) no Hoare annotation was computed. [2020-10-20 01:50:59,824 INFO L274 CegarLoopResult]: For program point L116-2(lines 116 125) no Hoare annotation was computed. [2020-10-20 01:50:59,824 INFO L274 CegarLoopResult]: For program point L116-3(lines 116 125) no Hoare annotation was computed. [2020-10-20 01:50:59,824 INFO L274 CegarLoopResult]: For program point L116-5(lines 116 125) no Hoare annotation was computed. [2020-10-20 01:50:59,824 INFO L274 CegarLoopResult]: For program point L116-6(lines 116 125) no Hoare annotation was computed. [2020-10-20 01:50:59,825 INFO L274 CegarLoopResult]: For program point L116-8(lines 116 125) no Hoare annotation was computed. [2020-10-20 01:50:59,825 INFO L274 CegarLoopResult]: For program point L116-9(lines 116 125) no Hoare annotation was computed. [2020-10-20 01:50:59,825 INFO L274 CegarLoopResult]: For program point L116-11(lines 116 125) no Hoare annotation was computed. [2020-10-20 01:50:59,825 INFO L274 CegarLoopResult]: For program point L116-12(lines 116 125) no Hoare annotation was computed. [2020-10-20 01:50:59,825 INFO L274 CegarLoopResult]: For program point L116-14(lines 116 125) no Hoare annotation was computed. [2020-10-20 01:50:59,825 INFO L274 CegarLoopResult]: For program point L117(lines 117 122) no Hoare annotation was computed. [2020-10-20 01:50:59,825 INFO L274 CegarLoopResult]: For program point L117-1(lines 117 122) no Hoare annotation was computed. [2020-10-20 01:50:59,825 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-10-20 01:50:59,825 INFO L274 CegarLoopResult]: For program point L117-2(lines 117 122) no Hoare annotation was computed. [2020-10-20 01:50:59,826 INFO L274 CegarLoopResult]: For program point L117-3(lines 117 122) no Hoare annotation was computed. [2020-10-20 01:50:59,826 INFO L274 CegarLoopResult]: For program point L117-4(lines 117 122) no Hoare annotation was computed. [2020-10-20 01:50:59,826 INFO L274 CegarLoopResult]: For program point L184(lines 184 189) no Hoare annotation was computed. [2020-10-20 01:50:59,826 INFO L274 CegarLoopResult]: For program point L184-1(lines 184 189) no Hoare annotation was computed. [2020-10-20 01:50:59,826 INFO L274 CegarLoopResult]: For program point L184-2(lines 184 189) no Hoare annotation was computed. [2020-10-20 01:50:59,827 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-10-20 01:50:59,827 INFO L274 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-10-20 01:50:59,827 INFO L274 CegarLoopResult]: For program point L284-1(lines 278 301) no Hoare annotation was computed. [2020-10-20 01:50:59,827 INFO L274 CegarLoopResult]: For program point L251-1(lines 250 273) no Hoare annotation was computed. [2020-10-20 01:50:59,827 INFO L274 CegarLoopResult]: For program point L251-2(lines 251 255) no Hoare annotation was computed. [2020-10-20 01:50:59,827 INFO L274 CegarLoopResult]: For program point L284-3(lines 278 301) no Hoare annotation was computed. [2020-10-20 01:50:59,827 INFO L274 CegarLoopResult]: For program point L251-4(lines 250 273) no Hoare annotation was computed. [2020-10-20 01:50:59,827 INFO L274 CegarLoopResult]: For program point L319(lines 319 323) no Hoare annotation was computed. [2020-10-20 01:50:59,827 INFO L274 CegarLoopResult]: For program point L352-1(lines 351 374) no Hoare annotation was computed. [2020-10-20 01:50:59,827 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-10-20 01:50:59,828 INFO L274 CegarLoopResult]: For program point L319-3(lines 319 323) no Hoare annotation was computed. [2020-10-20 01:50:59,828 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-10-20 01:50:59,828 INFO L274 CegarLoopResult]: For program point L319-6(lines 319 323) no Hoare annotation was computed. [2020-10-20 01:50:59,828 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-10-20 01:50:59,828 INFO L274 CegarLoopResult]: For program point L319-9(lines 319 323) no Hoare annotation was computed. [2020-10-20 01:50:59,828 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-10-20 01:50:59,829 INFO L274 CegarLoopResult]: For program point L319-12(lines 319 323) no Hoare annotation was computed. [2020-10-20 01:50:59,829 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-10-20 01:50:59,829 INFO L274 CegarLoopResult]: For program point L452(lines 452 456) no Hoare annotation was computed. [2020-10-20 01:50:59,829 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-10-20 01:50:59,830 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-10-20 01:50:59,830 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-10-20 01:50:59,831 INFO L274 CegarLoopResult]: For program point L421(line 421) no Hoare annotation was computed. [2020-10-20 01:50:59,831 INFO L274 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-10-20 01:50:59,831 INFO L274 CegarLoopResult]: For program point L289-1(lines 278 301) no Hoare annotation was computed. [2020-10-20 01:50:59,831 INFO L274 CegarLoopResult]: For program point L256-1(lines 250 273) no Hoare annotation was computed. [2020-10-20 01:50:59,831 INFO L274 CegarLoopResult]: For program point L289-3(lines 278 301) no Hoare annotation was computed. [2020-10-20 01:50:59,831 INFO L274 CegarLoopResult]: For program point L256-3(lines 250 273) no Hoare annotation was computed. [2020-10-20 01:50:59,832 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-10-20 01:50:59,832 INFO L274 CegarLoopResult]: For program point L92(line 92) no Hoare annotation was computed. [2020-10-20 01:50:59,832 INFO L274 CegarLoopResult]: For program point L357-1(lines 351 374) no Hoare annotation was computed. [2020-10-20 01:50:59,832 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-10-20 01:50:59,833 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-10-20 01:50:59,833 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-10-20 01:50:59,834 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-10-20 01:50:59,834 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-10-20 01:50:59,834 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-10-20 01:50:59,835 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-10-20 01:50:59,835 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-10-20 01:50:59,835 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-10-20 01:50:59,836 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-10-20 01:50:59,836 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-10-20 01:50:59,836 INFO L274 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-10-20 01:50:59,837 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-10-20 01:50:59,837 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-10-20 01:50:59,837 INFO L270 CegarLoopResult]: At program point L458(lines 405 463) the Hoare annotation is: (= ~t1_i~0 1) [2020-10-20 01:50:59,837 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-10-20 01:50:59,838 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-10-20 01:50:59,838 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-10-20 01:50:59,839 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-10-20 01:50:59,839 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-10-20 01:50:59,839 INFO L274 CegarLoopResult]: For program point L261-1(lines 250 273) no Hoare annotation was computed. [2020-10-20 01:50:59,840 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-10-20 01:50:59,840 INFO L274 CegarLoopResult]: For program point L261-3(lines 250 273) no Hoare annotation was computed. [2020-10-20 01:50:59,840 INFO L274 CegarLoopResult]: For program point L162-1(lines 161 174) no Hoare annotation was computed. [2020-10-20 01:50:59,840 INFO L274 CegarLoopResult]: For program point L394(lines 394 399) no Hoare annotation was computed. [2020-10-20 01:50:59,840 INFO L274 CegarLoopResult]: For program point L229(lines 229 236) no Hoare annotation was computed. [2020-10-20 01:50:59,840 INFO L274 CegarLoopResult]: For program point L362-1(lines 351 374) no Hoare annotation was computed. [2020-10-20 01:50:59,840 INFO L274 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2020-10-20 01:50:59,841 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 3) no Hoare annotation was computed. [2020-10-20 01:50:59,841 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-10-20 01:50:59,841 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-10-20 01:50:59,842 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-10-20 01:50:59,962 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.10 01:50:59 BoogieIcfgContainer [2020-10-20 01:50:59,962 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-20 01:50:59,963 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-20 01:50:59,963 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-20 01:50:59,963 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-20 01:50:59,964 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 01:50:33" (3/4) ... [2020-10-20 01:50:59,969 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-10-20 01:50:59,988 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2020-10-20 01:50:59,989 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2020-10-20 01:50:59,990 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-10-20 01:50:59,991 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-10-20 01:51:00,024 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-10-20 01:51:00,025 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-10-20 01:51:00,025 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-10-20 01:51:00,025 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-10-20 01:51:00,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-10-20 01:51:00,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) || ((((((((((!(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-10-20 01:51:00,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) || ((((((((((!(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-10-20 01:51:00,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) || ((((((((((!(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-10-20 01:51:00,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) || ((((((((((!(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-10-20 01:51:00,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) || ((((((((((!(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-10-20 01:51:00,028 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-10-20 01:51:00,028 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-10-20 01:51:00,029 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-10-20 01:51:00,029 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-10-20 01:51:00,029 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-10-20 01:51:00,030 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-10-20 01:51:00,030 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-10-20 01:51:00,031 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-10-20 01:51:00,031 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-10-20 01:51:00,031 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-10-20 01:51:00,032 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-10-20 01:51:00,032 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-10-20 01:51:00,032 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-10-20 01:51:00,033 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-10-20 01:51:00,033 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-10-20 01:51:00,033 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-10-20 01:51:00,034 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-10-20 01:51:00,034 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-10-20 01:51:00,034 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-10-20 01:51:00,035 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-10-20 01:51:00,035 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-10-20 01:51:00,035 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-10-20 01:51:00,035 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-10-20 01:51:00,036 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-10-20 01:51:00,036 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-10-20 01:51:00,036 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-10-20 01:51:00,037 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-10-20 01:51:00,037 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-10-20 01:51:00,037 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-10-20 01:51:00,037 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-10-20 01:51:00,038 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-10-20 01:51:00,038 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-10-20 01:51:00,038 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-10-20 01:51:00,093 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-10-20 01:51:00,093 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-20 01:51:00,095 INFO L168 Benchmark]: Toolchain (without parser) took 28221.55 ms. Allocated memory was 36.7 MB in the beginning and 211.8 MB in the end (delta: 175.1 MB). Free memory was 19.7 MB in the beginning and 12.6 MB in the end (delta: 7.1 MB). Peak memory consumption was 182.2 MB. Max. memory is 14.3 GB. [2020-10-20 01:51:00,096 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 33.6 MB. Free memory was 11.7 MB in the beginning and 11.7 MB in the end (delta: 47.4 kB). Peak memory consumption was 47.4 kB. Max. memory is 14.3 GB. [2020-10-20 01:51:00,096 INFO L168 Benchmark]: CACSL2BoogieTranslator took 587.88 ms. Allocated memory was 36.7 MB in the beginning and 44.0 MB in the end (delta: 7.3 MB). Free memory was 18.9 MB in the beginning and 23.1 MB in the end (delta: -4.1 MB). Peak memory consumption was 11.4 MB. Max. memory is 14.3 GB. [2020-10-20 01:51:00,097 INFO L168 Benchmark]: Boogie Procedure Inliner took 67.21 ms. Allocated memory is still 44.0 MB. Free memory was 23.1 MB in the beginning and 20.3 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 14.3 GB. [2020-10-20 01:51:00,097 INFO L168 Benchmark]: Boogie Preprocessor took 40.38 ms. Allocated memory is still 44.0 MB. Free memory was 20.3 MB in the beginning and 18.0 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 14.3 GB. [2020-10-20 01:51:00,098 INFO L168 Benchmark]: RCFGBuilder took 681.01 ms. Allocated memory was 44.0 MB in the beginning and 48.2 MB in the end (delta: 4.2 MB). Free memory was 18.0 MB in the beginning and 30.9 MB in the end (delta: -12.9 MB). Peak memory consumption was 10.1 MB. Max. memory is 14.3 GB. [2020-10-20 01:51:00,098 INFO L168 Benchmark]: TraceAbstraction took 26702.52 ms. Allocated memory was 48.2 MB in the beginning and 211.8 MB in the end (delta: 163.6 MB). Free memory was 30.2 MB in the beginning and 26.5 MB in the end (delta: 3.7 MB). Peak memory consumption was 192.3 MB. Max. memory is 14.3 GB. [2020-10-20 01:51:00,099 INFO L168 Benchmark]: Witness Printer took 130.97 ms. Allocated memory is still 211.8 MB. Free memory was 26.5 MB in the beginning and 12.6 MB in the end (delta: 13.9 MB). Peak memory consumption was 13.9 MB. Max. memory is 14.3 GB. [2020-10-20 01:51:00,101 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.28 ms. Allocated memory is still 33.6 MB. Free memory was 11.7 MB in the beginning and 11.7 MB in the end (delta: 47.4 kB). Peak memory consumption was 47.4 kB. Max. memory is 14.3 GB. * CACSL2BoogieTranslator took 587.88 ms. Allocated memory was 36.7 MB in the beginning and 44.0 MB in the end (delta: 7.3 MB). Free memory was 18.9 MB in the beginning and 23.1 MB in the end (delta: -4.1 MB). Peak memory consumption was 11.4 MB. Max. memory is 14.3 GB. * Boogie Procedure Inliner took 67.21 ms. Allocated memory is still 44.0 MB. Free memory was 23.1 MB in the beginning and 20.3 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 14.3 GB. * Boogie Preprocessor took 40.38 ms. Allocated memory is still 44.0 MB. Free memory was 20.3 MB in the beginning and 18.0 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 14.3 GB. * RCFGBuilder took 681.01 ms. Allocated memory was 44.0 MB in the beginning and 48.2 MB in the end (delta: 4.2 MB). Free memory was 18.0 MB in the beginning and 30.9 MB in the end (delta: -12.9 MB). Peak memory consumption was 10.1 MB. Max. memory is 14.3 GB. * TraceAbstraction took 26702.52 ms. Allocated memory was 48.2 MB in the beginning and 211.8 MB in the end (delta: 163.6 MB). Free memory was 30.2 MB in the beginning and 26.5 MB in the end (delta: 3.7 MB). Peak memory consumption was 192.3 MB. Max. memory is 14.3 GB. * Witness Printer took 130.97 ms. Allocated memory is still 211.8 MB. Free memory was 26.5 MB in the beginning and 12.6 MB in the end (delta: 13.9 MB). Peak memory consumption was 13.9 MB. Max. memory is 14.3 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.3s, OverallIterations: 17, TraceHistogramMax: 3, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 21.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 3493 SDtfs, 4846 SDslu, 3481 SDs, 0 SdLazy, 442 SolverSat, 162 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 72 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2384occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.3s AutomataMinimizationTime, 17 MinimizatonAttempts, 1336 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 52 LocationsWithAnnotation, 52 PreInvPairs, 754 NumberOfFragments, 13062 HoareAnnotationTreeSize, 52 FomulaSimplifications, 173500 FormulaSimplificationTreeSizeReduction, 2.7s HoareSimplificationTime, 52 FomulaSimplificationsInter, 52495 FormulaSimplificationTreeSizeReductionInter, 18.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s 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...